第4章-21 判断上三角矩阵
T = int(input())
cnt = 0
while cnt < T:
a = []
flag = False
cnt += 1
n = int(input())
for i in range(n):
s = input()
a.append([int(t) for t in s.split()])
for j in range(n):
for k in range(n):
if j > k:
if a[j][k] != 0:
flag = True
break
if flag:
break
if flag:
print('NO')
else:
print('YES')