#include <stdio.h>

int N = 0;

#define MAX (101)
int array[MAX][MAX] = { 0, };

int memo[MAX][MAX] = { 0, };

int jump(int x, int y)
{
    if (x >= N || y >= N)
        return 0;
    if ((x == N - 1) && (y == N - 1))
        return 1;

    int &ret = memo[x][y];

    if (ret != -1)
        return ret;

    int jumpSize = array[x][y];

    return ret = (jump(x+jumpSize, y) || jump(x, y+jumpSize));
}

int main(void)
{
    int C;
    int test_case;

    freopen("input.txt", "r", stdin);
    setbuf(stdout, NULL);

    scanf("%d", &C);
    //printf("%d\n", C);

    for (test_case = 0; test_case < C; ++test_case)
    {
        int result = -1;
        scanf("%d", &N);
        //printf("N: %d\n", N);

        for (int i = 0; i < N; i++)
        {
            for (int j = 0; j < N; j++)
            {
                scanf("%d", &array[i][j]);
                //printf("%d ", array[i][j]);
            }
            //printf("\n");
        }
        //printf("\n");

        //초기화
        for (int i = 0; i < N; i++)
            for (int j = 0; j < N;j++)
                memo[i][j] = -1;

        result = jump(0, 0);

        if (result == 1)
            printf("YES\n");
        else
            printf("NO\n");
    }

    return 0;
}
~~~ c++