#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("sse3","sse2","sse")
#pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
#pragma GCC target("f16c")
#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
#pragma GCC diagnostic error "-fwhole-program"
#pragma GCC diagnostic error "-fcse-skip-blocks"
#pragma GCC diagnostic error "-funsafe-loop-optimizations"
#pragma GCC diagnostic error "-std=c++14"
#include "bits/stdc++.h"
//#include "ext/pb_ds/tree_policy.hpp"
//#include "ext/pb_ds/assoc_container.hpp"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = l;x<u;x++)
#define RREP(x,l,u) for(ll x = l;x>=u;x--)
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) a.begin(),a.end()
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define sqr(x) ((x)*(x))
#define lowbit(x) (x&(-x))
#define lson (ind<<1)
#define rson (ind<<1|1)
#define se second
#define fi first
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define EX0 exit(0);

typedef  long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;
typedef vector<ll> VLL;
typedef vector<int> VI;
const int block_size = 320;
typedef complex<ll> point;
const ll mod = 1e9+7;
const ll inf = 1e9+7;
const ld eps = 1e-9;
const db PI = atan(1)*4;
template<typename T>
inline int sign(const T&a) {
    if(a<0)return -1;
    if(a>0)return 1;
    return 0;
}

template<typename T,typename S>inline bool upmin(T&a,const S&b){return a>b?a=b,1:0;}
template<typename T,typename S>inline bool upmax(T&a,const S&b){return a<b?a=b,1:0;}

template<typename T> inline void in(T &x) {
    x = 0;
    T f = 1;
    char ch = getchar();
    while (!isdigit(ch)) {
        if (ch == '-') f = -1;
        ch = getchar();
    }
    while (isdigit(ch))  {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    x *= f;
}

ll twop(int x) {
    return 1LL<<x;
}

template<typename A,typename B > inline void in(A&x,B&y) {
    in(x);
    in(y);
}
template<typename A,typename B,typename C>inline void in(A&x,B&y,C&z) {
    in(x);
    in(y);
    in(z);
}
template<typename A,typename B,typename C,typename D> inline void in(A&x,B&y,C&z,D&d) {
    in(x);
    in(y);
    in(z);
    in(d);
}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}

char g[610][610];
int sum[610][610];
int n;
bool invalid(PII x){
    if(max(x.fi,x.se) > 2*n)return true;
    return false;
}
int main() {

    
    
    
    
    
    
    
    in(n);
    REP(i,1,n+1){
        scanf("%s",g[i]+1);
    }
    REP(i,1,n+1){
        REP(j,1,n+1){
            g[i+n][j] = g[i][j];
            g[i][j+n] = g[i][j];
            g[i+n][j+n] = g[i][j];
        }
    }
//    REP(i,1,2*n+1){
//        REP(j,1,2*n+1){
//            putchar(g[i][j]);
//        }
//        cout<<endl;
//    }
    int ans = 0;
    int cnt = 0;
    REP(k,1,n+1){
        mst(sum,0);
        PII middle = MP(k,1);
        for(;;){
            if(invalid(middle))break;
            PII d = middle,r = middle;
            while (!invalid(d) && !invalid(r)) {
                if(g[d.fi][d.se] != g[r.fi][r.se]){
//                    dbg(d.fi);
//                    dbg(d.se);
//                    dbg(r.fi);
//                    dbg(r.se);
                    sum[d.fi][d.se] = 1;
                }
                d.fi++;
                r.se++;
            }
            middle.fi ++;middle.se++;

        }
        REP(i,1,2*n+1){
            REP(j,1,2*n+1){
                sum[i][j] += sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
            }
        }
        for(PII start = MP(k,1); max(start.fi,start.se)<=n;start.fi++,start.se++){
            ans += (sum[start.fi+n-1][start.se+n-1] - sum[start.fi-1][start.se+n-1] - sum[start.fi+n-1][start.se-1] + sum[start.fi-1][start.se-1]) == 0;
//            dbg(ans);
//
//            dbg(++cnt);
        }
        
    }
    REP(k,2,n+1){
        mst(sum,0);
        PII middle = MP(1,k);
        for(;;){
            if(invalid(middle))break;
            PII d = middle,r = middle;
            while (!invalid(d) && !invalid(r)) {
                if(g[d.fi][d.se] != g[r.fi][r.se]){
                    sum[d.fi][d.se] = 1;
                }
                d.fi++;
                r.se++;
            }
            middle.fi ++;middle.se++;

        }
        REP(i,1,2*n+1){
            REP(j,1,2*n+1){
                sum[i][j] += sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
            }
        }
        for(PII start = MP(1,k); max(start.fi,start.se)<=n;start.fi++,start.se++){
            ans += (sum[start.fi+n-1][start.se+n-1] - sum[start.fi-1][start.se+n-1] - sum[start.fi+n-1][start.se-1] + sum[start.fi-1][start.se-1]) == 0;
//            dbg(ans);
//            dbg(++cnt);

        }
        
    }

    
    cout<<ans;
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    return 0;
}


Measured memory_bytes: 2048