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

#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

using ll = int32_t; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
using ld = long double;  using vld = vector<ld>; 
using vi = vector<int>; using vvi = vector<vi>; vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }

inline void input(int &v){ v=0;char c=0;int p=1; while(c<'0' || c>'9'){if(c=='-')p=-1;c=getchar();} while(c>='0' && c<='9'){v=(v<<3)+(v<<1)+c-'0';c=getchar();} v*=p; } // これを使うならば、tieとかを消して！！
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) {  o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args> 
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T>  ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U>  ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]";  return o; }
template <typename T, typename U, typename V>  ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]";  return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
template <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
string substr(string s, P x) {return s.substr(x.fi, x.se - x.fi); }
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size())  rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << "    " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl;  } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
size_t random_seed; namespace std { using argument_type = P; template<> struct hash<argument_type> { size_t operator()(argument_type const& x) const { size_t seed = random_seed; seed ^= hash<ll>{}(x.fi); seed ^= (hash<ll>{}(x.se) << 1); return seed; } }; }; // hash for various class
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
struct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define ldout fixed << setprecision(40) 

#define EPS (double)1e-14
#define INF (ll)1e18
#define mo  (ll)(1e9+7)

class manacher {
public: 
    string s; // 元の入力文字列
    vll r; // a$b$c$aのように$で区切った文字列msに対して、ms[i]を中心とした最大半径
    vll pal; // s[i/2]を中心とした回文半径。abbaなら1012101

    // [l, r)が回文ならば1
    // 空文字列や、l>rではtrueを返す
    //
    // O(1)
    bool isPalindrome(ll l, ll r) {
        if (r - l <= 0) return 1;
        if ((r - l) % 2 == 0) {
            return (r - l) / 2 <= pal[l + r - 1];
        } else {
            return (r - l + 1) / 2 <= pal[l + r - 1];
        }
    }

    // O(n)
    manacher(string raw_s) : s(raw_s) {
        ll n = raw_s.size()*2-1;
        r.resize(n);
        pal.resize(n);

        // 偶数長の回文を扱うためにダミー文字を挿入
        string ms(n, '$'); 
        rep(i, raw_s.size()) ms[2*i] = s[i];

        // manacher
        int i = 0, j = 0;
        while (i < n) {
            while(i-j >= 0 && i+j < n && ms[i-j] == ms[i+j]) ++j;
            r[i] = j;
            int k = 1;
            while(i-k >= 0 && i+k < n && k+r[i-k] < j) r[i+k] = r[i-k], ++k;
            i += k; j -= k;
        }

        // 半径を計算
        rep(i, pal.size()) pal[i] = (r[i] + (i % 2 == 0)) / 2;
    }
};


int main(void) {
    ll n; cin >> n;
    vector<string> bb(n);
    rep(i,n)cin>>bb[i];
    ll N = 4*n;
    vvll c(N,vll(N,100000));
    vector<string> b(N);
    rep(_, 2) {
        rep(i,n) {
            rep(k,2){ 
                rep(j,n) {
                    b[_*2*n+i*2]+=bb[i][j];
                    b[_*2*n+i*2]+='$';
                }
            }
            b[_*2*n+2*i+1] = string(N,'$');
        }
    }

    /*
    rep(i,N){
        cout << b[i] << endl;
    }
    */
    rep(_,2) {
    rep(i,N/2)rep(j,N/2){
        ll ni = 2*i+_;
        ll nj = 2*j+_;
        c[ni][nj]=0;
        repi(k,0,N+10) {
            ll ii=ni-k;
            if (!(0<=ii&&ii<N)) break;
            ll jj=nj+k;
            if (!(0<=jj&&jj<N)) break;
            ll iii=ni+k;
            if (!(0<=iii&&iii<N)) break;
            ll jjj=nj-k;
            if (!(0<=jjj&&jjj<N)) break;
            if (b[ii][jj]==b[iii][jjj]) {
                c[ni][nj]++;
            } else {
                break;
            }
        }
    }
    }
    /*
    rep(i,N){
        rep(j,N){
            cout << c[i][j]<< " ";
        }
        cout << endl;
    }
    */



    /*
    vvll d(N,vll(N));
    rep(i,N){
        string s;
        rep(k,N) {
            if(

        }
    }
    */

    vll m(n*2);
    rep(i,n*2) {
        m[i] = i+1;
    }
    rep(i,n*2) {
        if (m[2*n-1-i]>i+1) m[2*n-1-i]=i+1;
    }
//    cout << m << endl;
    ll ret = 0;
    rep(i, n) rep(j, n) {
        ll faf = 1;
        rep(k,2*n) {
            ll ii = 2*i + k;
            ll jj = 2*j + k;
            faf &= c[ii][jj] >= m[k];
            if (c[ii][jj]<m[k]) {
                faf = 0;
                break;
            }
//            cout << c[ii][jj];
        }
//        cout << endl;
        ret += faf;
    }
    cout << ret << endl;


    return 0;
}


Measured memory_bytes: 8188