import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

n = int(input())
s = [input().rstrip() for i in range(n)]

cnt = 0
for i in range(n):
    tmp = 0
    tmp2 = 0
    for j in range(n):
        tmp += s[i][j] == "A"
        tmp2 += s[i][j] == "."
    cnt += (tmp==(n-1)) & (tmp2 == 1)
for j in range(n):
    tmp = 0
    tmp2 = 0
    for i in range(n):
        tmp += s[i][j] == "A"
        tmp2 += s[i][j] == "."
    cnt += (tmp==(n-1)) & (tmp2 == 1)

tmp = 0
tmp2 = 0
for i in range(n):
    tmp += s[i][i] == "A"
    tmp2 += s[i][i] == "."
cnt += (tmp==(n-1)) & (tmp2 == 1)

tmp = 0
tmp2 = 0
for i in range(n):
    tmp += s[i][n-i-1] == "A"
    tmp2 += s[i][n-i-1] == "."
cnt += (tmp==(n-1)) & (tmp2 == 1)

print(cnt)