#include <cstdio>
#include <iostream>
#include <queue>
#include <algorithm>
#include <string.h>
#include <stack>

using namespace std;
int n;
int ddang[101][101];

bool bfs(int r,int c){

    bool visited[101][101];
    memset(visited,false,sizeof(visited));
    visited[r][c] = true;
    queue<pair<int,int> > q;
    q.push(make_pair(r,c));

    while(!q.empty()){
        int r = q.front().first;
        int c = q.front().second;
        q.pop();
        if(r == n-1 && c== n-1)
            return true;

        int jump = ddang[r][c] ;
        if( r+jump >=0 && r+jump < n && c >=0 && c< n){
            if(visited[r+jump][c] )
                continue;
            visited[r+jump][c]= true;
            q.push(make_pair(r+jump , c));
        }
        if( r >=0 && r < n && c+jump >=0 && c+jump < n){
            if(visited[r][c+jump] )
                continue;
            visited[r][c+jump]= true;
            q.push(make_pair(r , c+jump));
        }

    }
    return false;
}

int main(){
    int t;
    cin >> t;
    while(t--){
        scanf("%d",&n);
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                scanf("%d",&ddang[i][j]);
            }
        }

        printf("%s\n",bfs(0,0) ? "YES" : "NO");

    }
}