// g++-15 1.cpp -std=c++23 -O2 -I .
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;

// #include <atcoder/dsu>
// using namespace atcoder;

using ll = long long;
using ld = long double;
 
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vst = vector<string>;
using vvst = vector<vst>;

#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define pq_big(T) priority_queue<T,vector<T>,less<T>>
#define pq_small(T) priority_queue<T,vector<T>,greater<T>>
#define all(a) a.begin(),a.end()
#define rep(i,start,end) for(ll i=start;i<(ll)(end);i++)
#define per(i,start,end) for(ll i=start;i>=(ll)(end);i--)
#define uniq(a) sort(all(a));a.erase(unique(all(a)),a.end())

random_device seed;
mt19937_64 randint(seed());

ll grr(ll mi, ll ma) { // [mi, ma)
    return mi + randint() % (ma - mi);
}

void solve(){
  int n;cin>>n;
  vst g(n);
  rep(i,0,n)cin>>g[i];
  vi dir(2*(n-1),1);
  rep(i,0,n-1)dir[i]=0;
  int ans=0;
  do{
    string s="";
    s+=g[0][0];
    int x=0,y=0;
    rep(i,0,2*(n-1)){
      if(dir[i])x++;
      else y++;
      s+=g[x][y];
    }
    string rs=s;
    reverse(all(rs));
    if(s==rs)ans++;
  }while(next_permutation(all(dir)));
  cout<<ans<<endl;
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t=1;
  // cin>>t;
  while(t--){
    solve();
  }
}