#!/bin/python3

import os

# Complete the solve function below.
def solve(board):
    first = board[0][0]
    at=first
    for row in board:
        for i in row:
            if i != at:
                return('No')
            if at ==1:
                at=0
            else:
                at=1
        if len(board[0])%2==0:
            if at ==1:
                at=0
            else:
                at=1
    return('Yes')

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()