import sys
N = int(sys.stdin.readline())
papers = [list(map(int, input().split())) for _ in range(N)]
minus_paper, zero_paper, one_paper = 0, 0, 0
def solution(x, y, n):
global minus_paper, zero_paper, one_paper
color = papers[x][y]
for i in range(x, x+n):
for j in range(y, y+n):
if color != papers[i][j]:
solution(x, y, n//3)
solution(x+n//3, y, n//3)
solution(x+(n//3)*2, y, n//3)
solution(x, y+n//3, n//3)
solution(x+n//3, y+n//3, n//3)
solution(x+(n//3)*2, y+n//3, n//3)
solution(x, y+(n//3)*2, n//3)
solution(x+n//3, y+(n//3)*2, n//3)
solution(x+(n//3)*2, y+(n//3)*2, n//3)
return
if color == -1:
minus_paper += 1
elif color == 0:
zero_paper += 1
else:
one_paper += 1
solution(0, 0, N)
print(minus_paper)
print(zero_paper)
print(one_paper)
* '색종이 만들기' 문제와 매우 비슷하다.