ans=[]
for _ in range(int(input())):
n=int(input())
k=0
x=[]
for i in range(n):
s=list(map(int, input().split()))
x.append(s)
for i in range(n):
for j in range(n):
if (i+j)%4==0 and i+j<n and j%2==0:
k=k^x[i][j]
if (i+j)%4==0 and i+j>=n and j%2!=0:
k=k^x[i][j]
if (n-1-i+j)%4==0 and (n-1-i+j)<n and j%2==0:
k=k^x[i][j]
if (n-1-i+j)%4==0 and (n-1-i+j)>=n and j%2!=0:
k=k^x[i][j]
ans.append(k)
print('\n'.join([str(i) for i in ans]))
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |
1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |
1594B - Special Numbers | 1614A - Divan and a Store |
2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |