#!/bin/python3

import math
import os
import random
import re
import sys

# Complete the solve function below.
def solve(board):
    n = len(board)
    b = all(board[i][j+1] != board[i][j] for i in range(n) for j in range(n - 1)) and \
        all(board[i+1][j] != board[i][j] for i in range(n - 1) for j in range(n))
    return 'Yes' if b else 'No'

if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    t = int(input().strip())

    for t_itr in range(t):
        n = int(input().strip())

        board = []

        for _ in range(n):
            board.append(list(map(int, input().rstrip().split())))

        result = solve(board)

        fptr.write(result + '\n')

    fptr.close()