#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec vector
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back 
#define eb emplace_back

using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
const ll mod = 998244353;
using mint = modint998244353;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};
// using Graph = vector<vector<pair<int,ll>>>;
using Graph = vector<vector<int>>;

bool is_palindrome(string s){
  int n = s.size();
  rep(i,n)
    if(s[i] != s[n-1-i])
      return false;

  return true;
}

int main(){
  // input
  int N;
  cin >> N;
  vector<string> S(N);
  rep(i,N) cin >> S[i];

  // solve
  int M = 2*N-2, ans = 0;
  rep(bt,1<<M){
    if(__builtin_popcount(bt) != N-1) continue;
    
    string tmp;
    int x = 0, y = 0;
    tmp += S[x][y];
    rep(i,M){
      (bt & (1<<i) ? x : y) += 1;
      tmp += S[x][y];
    }

    if(is_palindrome(tmp)) ans++;
  }

  // output
  cout << ans << endl;
}