# Input
N = int(input())
assert 2 <= N <= 100
v = []
for _ in range(N):
  s = input()
  assert len(s) == N
  v.append(s)
assert len(v) == N

# Solve
ans = 0
a_num = b_num = 0

# Check rows + assert
for i in range(N):
    a = b = 0
    for j in range(N):
        if v[i][j] == 'A':
            a += 1
            a_num += 1
        elif v[i][j] == 'B':
            b += 1
            b_num += 1
        assert v[i][j] in ['A', 'B', '.']
    if a == N-1 and b == 0:
        ans += 1
    assert a < N
    assert b < N

# Check columns
for j in range(N):
    a = b = 0
    for i in range(N):
        if v[i][j] == 'A':
            a += 1
        elif v[i][j] == 'B':
            b += 1
    if a == N-1 and b == 0:
        ans += 1
    assert a < N
    assert b < N

# Check diagonals
a1 = a2 = b1 = b2 = 0
for i in range(N):
    if v[i][i] == 'A':
        a1 += 1
    if v[i][i] == 'B':
        b1 += 1
    if v[i][N-1-i] == 'A':
        a2 += 1
    if v[i][N-1-i] == 'B':
        b2 += 1

if a1 == N-1 and b1 == 0:
    ans += 1
if a2 == N-1 and b2 == 0:
    ans += 1

# Asserts
assert a1 < N and a2 < N and b1 < N and b2 < N
assert a_num == b_num

# Output
assert ans > 0
print(ans)