#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n;
string s[75];
string ok;

void tr() {
	inc(i, n) {
	inc(j, i) {
		swap(s[i][j], s[j][i]);
	}
	}
}

void rv() {
	inc(i, n) {
	inc(j, n / 2) {
		swap(s[i][j], s[i][n - 1 - j]);
	}
	}
}

void rt() {
	tr();
	rv();
}

int f() {
	int c = 0;
	inc(i, n) {
		if(s[i].substr(0, n - 1) == ok || s[i].substr(1) == ok) { c++; }
	}
	return c;
}

int g() {
	incID(i, 1, n) { if(s[i][0] != '.') { return 0; } }
	int c = 1;
	if(s[0].substr(0, n - 1) == ok || s[0].substr(1) == ok) { c++; }
	incID(i, 1, n) {
		if(s[i].substr(1) == ok) { c++; }
	}
	return c;
}

int main() {
	cin >> n;
	inc(i, n) { cin >> s[i]; }
	
	ok = string(n - 1, '.');
	
	int ans = 0;
	setmax(ans, f()); rt();
	setmax(ans, f());
	
	inc(i, 8) {
		if(i == 4) { rv(); }
		// inc(j, n) { cout << s[j] << endl; } cout << endl;
		setmax(ans, g());
		rt();
	}
	
	cout << ans << endl;
	
	return 0;
}