import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    long MOD = 1_000_000_007;
    long inf = Long.MAX_VALUE;

    void solve(){
        int n = ni();
        char[][] map = nm(n,n);
        char[][] nmap = new char[n][n];
        int ans = 0;
        for(int r = 0; r < 8; r++){
            for(int i = 0; i < n; i++){
                for(int j = 0; j < n; j++){
                    if(r==0){
                        nmap[i][j] = map[i][j];
                    }
                    if(r==1){
                        nmap[i][j] = map[n-1-i][j];
                    }
                    if(r==2){
                        nmap[i][j] = map[n-1-i][n-1-j];
                    }
                    if(r==3){
                        nmap[i][j] = map[i][n-1-j];
                    }
                    if(r==4){
                        nmap[i][j] = map[j][i];
                    }
                    if(r==5){
                        nmap[i][j] = map[n-1-j][i];
                    }
                    if(r==6){
                        nmap[i][j] = map[n-1-j][n-1-i];
                    }
                    if(r==7){
                        nmap[i][j] = map[j][n-1-i];
                    }
                }
            }
            // for(int i = 0; i < n; i++){
            //     for(int j = 0; j < n; j++){
            //         out.print(nmap[i][j]);
            //     }
            //     out.println();
            // }
            // out.println(f(nmap,n));
            // out.println();
            ans = Math.max(f(nmap,n), ans);
        }
        out.println(ans);
    }

    int f(char[][] map, int n){
        int ans = 0;
        int res = 0;
        for(int i = 0; i < n; i++){
            res = 0;
            for(int j = 0; j < 1; j++){
                for(int k = j; k < j+n-1; k++){
                    if(map[i][k]=='#'){
                        res = 0;
                        break;
                    }
                    res = 1;
                }
                if(res==1){
                    ans++;
                    break;
                }
            }
        }
        int ans2 = 0;
        for(int k = 0; k < 1; k++){
            res = 0;
            for(int i = k; i < k+n-1; i++){
                if(map[i][0]=='#'){
                    res = 0;
                    break;
                }
                res = 1;
            }
            if(res==1){
                ans2++;
                break;
            }
        }
        res = 0;
        for(int i = 0; i < n; i++){
            for(int k = 1; k < n; k++){
                if(map[i][k]=='#'){
                    res = 0;
                    break;
                }
                res = 1;
            }
            if(res==1) ans2++;
        }
        ans = Math.max(ans,ans2);
        int ans3 = 0;
        res = 0;
        for(int i = 0; i < n-1; i++){
            if(map[i][0]=='#'){
                res = 0;
                break;
            }
            res = 1;
        }
        if(res==1){
            ans3++;
        }
        res = 0;
        for(int i = 0; i < n-1; i++){
            for(int k = 1; k < n; k++){
                if(map[i][k]=='#'){
                    res = 0;
                    break;
                }
                res = 1;
            }
            if(res==1) ans3++;
        }
        res = 0;
        for(int j = 0; j < n-1; j++){
            if(map[n-1][j]=='#'){
                res = 0;
                break;
            }
            res = 1;
        }
        if(res==1) ans3++;
        ans = Math.max(ans,ans3);
        int ans4 = 0;
        res = 0;
        for(int i = 0; i < n-1; i++){
            if(map[i][0]=='#'){
                res = 0;
                break;
            }
            res = 1;
        }
        if(res==1) ans4++;
        res = 0;
        for(int i = 0; i < n-1; i++){
            if(map[n-1][i]=='#'){
                res = 0;
                break;
            }
            res = 1;
        }
        if(res==1) ans4++;
        res = 0;
        for(int i = 0; i < n-1; i++){
            if(map[i+1][n-1]=='#'){
                res = 0;
                break;
            }
            res = 1;
        }
        if(res==1) ans4++;
        res = 0;
        for(int i = 0; i < n-1; i++){
            if(map[0][i+1]=='#'){
                res = 0;
                break;
            }
            res = 1;
        }
        if(res==1) ans4++;
        ans = Math.max(ans,ans4);
        return ans;
    }
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
 
}