import java.util.Scanner;

public class Main {
    private static Scanner sc;

    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int cases = sc.nextInt();
        while(cases-- > 0) {
            int size = sc.nextInt();

            int[][] matrix = new int[size][size];
            for (int i = 0; i < matrix.length; i++) {
                for (int j = 0; j < matrix[0].length; j++) {
                    matrix[i][j] = sc.nextInt();
                }
            }

            int[][] cache = new int[size][size];
            for (int i = 0; i < cache.length; i++) {
                for (int j = 0; j < cache[0].length; j++) {
                    cache[i][j] = -1;
                }
            }

            if( jump(cache, matrix, 0, 0) > 0 ) System.out.println("YES");
            else    System.out.println("NO");
        }
    }

    //  base: x == y == matrix.size return true, x > matrix.size || y > matrix.size return false
    //  induction: jump(x+matrix[x][y], y) || jump(x, y+matrix[x][y]
    private static int jump(int[][] cache, int[][] matrix, int y, int x) {
        int len = matrix.length - 1;
        if( x > len || y > len )    return 0;
        if( x == len && y == len )  return 1;

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

        return cache[y][x] = jump(cache, matrix, y+matrix[y][x], x) + jump(cache, matrix, y, x+matrix[y][x]);
    }
}