#include <iostream>

using namespace std;

bool findPath = false;

inline int jump(int current, int jump) { return current + jump; }

void find(int* maze, int* check_maze,int current, int size) {
    int move = maze[current];
    cout << "좌표 : (" << current%size << ", " << current / size << ")" << endl;


        if (move == 0) {
            findPath = true;
            return;
        }
        else{
            int right = jump(current, move);
            int down = jump(current, move * size);
            if (right < (current / size + 1)*size  && !findPath) {
                if(check_maze[right]!=1)
                    find(maze, check_maze, right, size);
            }
            if (down / size < size  && !findPath) {
               if(check_maze[down]!=1)
                    find(maze, check_maze, down, size);
            }
            check_maze[current]=1;

        }

}

int main() {
    int testCase;
    int size;

    cin >> testCase;
    bool* find_result = new bool[testCase];

    for (int i = 0; i < testCase; i++) {
        cin >> size;
        int* maze = new int[size*size];
        int* check_maze=new int[size*size];

        for (int j = 0; j < size; j++) {
            int m = j*size;
            for (int k = 0; k < size; k++) {
                cin >> maze[m + k];
            }
        }

        find(maze, check_maze, 0, size);
        find_result[i] = findPath;

        delete[] maze;
        findPath = false;
    }

    for (int i = 0; i < testCase; i++) {
        if (find_result[i]) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
    return 0;
}