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

#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a)           cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b)         cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c)       cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d)     cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e)   cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,n) cout<<#a<<"=["; printarray(a,n); cout<<"]\n"
#define DAR(a,n,s) cout<<#a<<"["<<s<<"-"<<n-1<<"]=["; printarray(a,n,s); cout<<"]\n"

#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){       bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) {     bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){    bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 sz, T2 beg = 0){ for (T2 i = beg; i<sz; i++) cout << a[i] << " "; cout << endl; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;

#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)

#define endl '\n'

ll P1 = 1000000009, Q1 = 1000001491, P2 = 1000004099, Q2 = 1000004867;
ll fpow(ll a, ll b, ll mod){
	ll res = 1, t = a;
	while( b ){
		if( b&1 ) res = (res*t)%mod;
		t = (t*t)%mod;
		b >>= 1;
	}
	return res;
}
ll inv(ll x, ll mod){ return fpow(x,mod-2,mod); }

Pll ppow[100500]; Pll pinv[100500];
Pll operator * (Pll a, Pll b){ return {a.Fi*b.Fi%Q1, a.Se*b.Se%Q2}; }
Pll operator + (Pll a, Pll b ){ return {(a.Fi+b.Fi)%Q1, (a.Se+b.Se)%Q2}; }
Pll operator - (Pll a, Pll b ){ return {(a.Fi-b.Fi+Q1)%Q1, (a.Se-b.Se+Q2)%Q2}; }
bool operator != (Pll a, Pll b){ return a.Fi!=b.Fi||a.Se!=b.Se; }
bool isp(ll x){
	for(ll i=2;i*i<=x;i++) if( x%i == 0 ) return false;
	return true;
}
int N;
ll p[1000][1000];
string s[1000];
Pll r[1000][1000], c[1000][1000];

int main() {
	ios::sync_with_stdio(false); cin.tie(NULL);
	ppow[0] = {1,1}; pinv[0] = {1,1};
	for(ll i=1;i<=100400;i++){
		ppow[i] = (ppow[i-1] * make_pair(P1,P2)); 
		pinv[i] = {inv(ppow[i].Fi, Q1), inv(ppow[i].Se, Q2)};
	}

	geti(N);
	rep(i,N) cin >> s[i];
	rep(i,N) rep(j,N){
		p[i][j] = s[i][j]-'a';
	}

	rep(i,3*N) rep(j,3*N){
		p[i][j] = p[i%N][j%N];
	}
	for(int i=0;i<N*2;i++){
		Pll h = {0,0};
		for(int j=0;j<N;j++) h = (h + ppow[j]*make_pair(p[i][j], p[i][j]));
		r[i][0] = h;
		for(int j=1;j<N*2;j++){
			h = h - ppow[0] * make_pair(p[i][j-1], p[i][j-1]);
			h = h * pinv[1];
			h = h + ppow[N-1] * make_pair(p[i][j+N-1], p[i][j+N-1]);
			r[i][j] = h;
		}

		h = {0,0};
		for(int j=0;j<N;j++) h =(h + ppow[j]*make_pair(p[j][i], p[j][i]));
		c[0][i] = h;
		for(int j=1;j<N*2;j++){
			h = h - ppow[0] * make_pair(p[j-1][i], p[j-1][i]);
			h = h * pinv[1];
			h = h + ppow[N-1] * make_pair(p[j+N-1][i], p[j+N-1][i]);
			c[j][i] = h;
		}
	}

	ll ans = 0;

	rep(i,N){
		rep(j,N){
			bool flag = true;
			for(int k=0;k<N;k++){
				if( r[i+k][j] != c[i][j+k] ){
					flag = false;
				}
			}
			if( flag ) ans++;
		}
	}
	cout << ans << endl;
}


Measured memory_bytes: 34048