#include <iostream>
#include <cstring>
using namespace std;

int board[100][100];
int cache[100][100];

int jump(int y, int x)
{
    //기저사례
    if(y >= 100 || x >= 100)
        return 0;
    if(y == 100-1 && x == 100-1) 
        return 1;

    int &ret = cache[y][x];
    if (ret != -1)
        return ret;

    return ret = (jump(y+board[y][x], x) || jump(y, x+board[y][x]));
}

int main(void)
{
    int test_case, maxsize;
    scanf("%d", &test_case);

    if(test_case < 0 || test_case > 50)
        exit(-1);

    for (int i = 0; i <test_case; i++)
    {
        scanf("%d", &maxsize);
        if(maxsize < 2 || maxsize > 100)
            exit(-1);

        memset(cache, -1, sizeof(cache)); 
        //멤셋을 이용해 cache[]초기화 but,한정적이니 조심


        for(int j = 0; j <maxsize; j++)
            for(int k = 0; k < maxsize; k++)
                scanf("%d", &board[j][k]);

        if (jump(0,0) == 1)
            printf("YES\n");
        else
            printf("NO\n");
    }

}