#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(long long i = 0; i < (long long)(N); i++)
#define repr(i,N) for(long long i = (long long)(N) - 1; i >= 0; i--)
#define rep1(i,N) for(long long i = 1; i <= (long long)(N) ; i++)
#define repr1(i,N) for(long long i = (N) ; (long long)(i) > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; template<class T = ll> using V = vector<T>;
using vi = V<int>; using vl = V<>; using vvi = V< V<int> >;
constexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif
 
#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)
#define in2(N,s,t) rep(i,N){in(s[i] , t[i]);}
#define in3(N,s,t,u) rep(i,N){in(s[i] , t[i] , u[i]);}
using vd = V<double>; using vs = V<string>; using vvl = V< V<> >;
template<typename T>using heap = priority_queue< T , V<T> , greater<T> >;
 
using P = pair<ll,ll>; using vp = V<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
//////////////////


void solve(){
  ini(N);
  vs g(N); in(g);

  int cnt[26] = {};
  rep(i , N) rep(j , N){
    cnt[g[i][j] - 'a']++;
  }
  trca(cnt , 26);
  int idx = -1 , val = inf;
  rep(i , 26){
    if(cnt[i] != 0 && cnt[i] < val)
      idx = i , val = cnt[i];
  }
  trc(idx , val);
  if(val == N * N) die(N * N);
  int ni = -1, nj = -1, nyaan = 0;
  for(ni = 0 ; ni < N && nyaan == 0; ni++){
    for(nj = 0 ; nj < N ; nj++){
      if(g[ni][nj] == 'a' + idx) { nyaan = 1; break; }
    }
    if(nyaan == 1) break;
  }
  trc(ni , nj);

  vs h(N , string(N , 'A'));
  rep(i , N) rep(j , N){
    h[i][j] = g[(i + N - ni) % N][(j + N - nj) % N];
  }
  swap(g , h);
  trc(g);

  int ans = 0;
  rep(A , N){
    int B = 0;
    int flg = 1;
    rep(i , N){
      rep(j , N){
        // i,jはi+A,j+Bに移動
        // 反対側はj+B,i+A
        // もとはj+B-A,i+A-B
        flg = g[i][j] == g[(j + B + N - A) % N][(i + A + N - B) % N];
        if(flg == 0) break;
      }
      if(flg == 0) break;
    }
    ans += flg * N;
  }
  out(ans);

}

Measured memory_bytes: 512