#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;

typedef struct _POINT{
    int x,y;
}Point;

int n;
int board[100][100];

bool bfs(Point& sp)
{
    bool ret=false;
    queue<Point> q;
    q.push(sp);
    while(!q.empty())
    {
        Point p=q.front();
        q.pop();
        if((p.x==n-1)&&(p.y==n-1))
        {
            ret=true;
            break;
        }
        Point p1,p2;
        p1.x=0,p1.y=0;
        p2.x=0,p2.y=0;
        int nx1=p.x+board[p.x][p.y],ny1=p.y;
        if(nx1<n&&ny1<n)
        {
            p1.x=nx1,p1.y=ny1;
            q.push(p1);
        }
        int nx2=p.x,ny2=p.y+board[p.x][p.y];
        if(nx2<n&&ny2<n)
        {
            p2.x=nx2,p2.y=ny2;
            q.push(p2);
        }
    }
    return ret;
}

int main() {
    int C;
    scanf("%d",&C);
    while(C!=0)
    {
        --C;
        memset(board,0,sizeof(board));
        scanf("%d",&n);
        for(int i=0; i<n; ++i)
        {
            for(int j=0; j<n; ++j)
            {
                scanf("%d",&board[i][j]);
            }
        }
        Point sp;
        sp.x=0,sp.y=0;
        if(bfs(sp)) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}