#include #define rep(i,a,b) for(int i=a;i=b;i--) #define fore(i,a) for(auto &i:a) #define all(x) (x).begin(),(x).end() #pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b> N; rep(y, 0, N) cin >> S[y]; int ans = 0; rep(i, 0, 4) { //rep(y, 0, N) cout << S[y] << endl; cout << endl; // 1 : 全部縦 { int cnt = 0; rep(x, 0, N) { int ok = 0; int c = 0; rep(y, 0, N - 1) if (S[y][x] == '.') c++; if (c == N - 1) ok = 1; c = 0; rep(y, 1, N) if (S[y][x] == '.') c++; if (c == N - 1) ok = 1; if (ok) cnt++; } chmax(ans, cnt); } // 2-1 : 縦+上右寄せ { int cnt = 0, ok, c; c = 0; rep(x, 1, N) if (S[0][x] == '.') c++; if (c == N - 1) cnt++; rep(x, 1, N) { int c = 0; rep(y, 1, N) if (S[y][x] == '.') c++; if (c == N - 1) cnt++; } ok = 0; c = 0; rep(y, 0, N - 1) if (S[y][0] == '.') c++; if (c == N - 1) ok = 1; c = 0; rep(y, 1, N) if (S[y][0] == '.') c++; if (c == N - 1) ok = 1; if (ok) cnt++; chmax(ans, cnt); } // 2-2 : 縦+上左寄せ { int cnt = 0, ok, c; c = 0; rep(x, 0, N - 1) if (S[0][x] == '.') c++; if (c == N - 1) cnt++; rep(x, 0, N - 1) { int c = 0; rep(y, 1, N) if (S[y][x] == '.') c++; if (c == N - 1) cnt++; } ok = 0; c = 0; rep(y, 0, N - 1) if (S[y][N-1] == '.') c++; if (c == N - 1) ok = 1; c = 0; rep(y, 1, N) if (S[y][N-1] == '.') c++; if (c == N - 1) ok = 1; if (ok) cnt++; chmax(ans, cnt); } rep(y, 0, N) rep(x, y + 1, N) swap(S[y][x], S[x][y]); if (i % 2 == 1) rep(y, 0, N) reverse(all(S[y])); } // 特殊パターン { int cnt = 0, c; c = 0; rep(y, 0, N - 1) if (S[y][0] == '.') c++; if (c == N - 1) cnt++; c = 0; rep(x, 0, N - 1) if (S[N - 1][x] == '.') c++; if (c == N - 1) cnt++; c = 0; rep(y, 1, N) if (S[y][N - 1] == '.') c++; if (c == N - 1) cnt++; c = 0; rep(x, 1, N) if (S[0][x] == '.') c++; if (c == N - 1) cnt++; chmax(ans, cnt); } rep(y, 0, N) rep(x, 0, N / 2) swap(S[y][x], S[y][N - 1 - x]); { int cnt = 0, c; c = 0; rep(y, 0, N - 1) if (S[y][0] == '.') c++; if (c == N - 1) cnt++; c = 0; rep(x, 0, N - 1) if (S[N - 1][x] == '.') c++; if (c == N - 1) cnt++; c = 0; rep(y, 1, N) if (S[y][N - 1] == '.') c++; if (c == N - 1) cnt++; c = 0; rep(x, 1, N) if (S[0][x] == '.') c++; if (c == N - 1) cnt++; chmax(ans, cnt); } cout << ans << endl; }