#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <cctype>
#include <complex>
using namespace std;

#define INF_LL (ll)1e18
#define INF (int)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
using ll = long long;
using PII = pair<int, int>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

int N;
vector<string> f;

int fil(){
	vector<string> fc = f;
	int cnt = 0;
	N = fc.size();
	REP(i, N){
		if(fc[i].substr(0, N-1) == string(N-1, '.')){
			cnt++;
			REP(j, N-1)
				fc[i][j] = '#';
		}else if(fc[i].substr(1, N-1) == string(N-1, '.')){
			cnt++;
			REP(j, N-1)
				fc[i][j+1] = '#';
		}
	}
	REP(i, N){
		int c = 0;
		REP(j, N){
			if(fc[j][i] == '.')
				c++;
			else
				c = 0;
			if(c == N-1){
				cnt++;
			}
		}
	}
	return cnt;
}

int main(void){
	int N;
	cin >> N;
	f.resize(N);
	REP(i, N){
		cin >> f[i];
	}
	int res = 0;
	res = max(res, fil());
	REP(i, N){
		reverse(all(f[i]));
	}
	res = max(res, fil());
	REP(i, N){
		REP(j, N/2){
			swap(f[j][i], f[N-j-1][i]);
		}
	}
	res = max(res, fil());
	REP(i, N){
		reverse(all(f[i]));
	}
	res = max(res, fil());
	cout << res << endl;
}