#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
void Main()
{
	int N;
	cin >> N;
	vector<string> S(N);
	for(int i = 0;i < N;i++)
	{
		cin >> S[i];
	}
	int ans = 0;
	for(int i = 0;i < N;i++)
	{
		for(int j = 0;j < N;j++)
		{
			if(S[i][j] == '.')
			{
				{
					bool ok = true;
					for(int k = 0;k < N;k++)
					{
						if(k != j && S[i][k] != 'A')
						{
							ok = false;
							break;
						}
					}
					if(ok)
					{
						ans++;
					}
				}
				{
					bool ok = true;
					for(int k = 0;k < N;k++)
					{
						if(k != i && S[k][j] != 'A')
						{
							ok = false;
							break;
						}
					}
					if(ok)
					{
						ans++;
					}
				}
				if(2 * i + 1 == N  && 2 * j + 1 == N)
				{
					{
						bool ok = true;
						for(int k = 0;k < N;k++)
						{
							if(k != i && S[k][k] != 'A')
							{
								ok = false;
							}
						}
						if(ok)
						{
							ans++;
						}
					}
					{
						bool ok = true;
						for(int k = 0;k < N;k++)
						{
							if(k != i && S[k][N - k - 1] != 'A')
							{
								ok = false;
							}
						}
						if(ok)
						{
							ans++;
						}
					}
				}
			}
		}
	}
	cout << ans << "\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}