#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1ll<<(x))-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;
inline int bsf(ull x) { return __builtin_ctzll(x);}
inline int bsr(ull x) { return 63^__builtin_clzll(x);}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> Tree;
#define umap gp_hash_table
int n;
vvi g;

ll dp[41][41][41];


ll dfs(int l, int i, int r) {
  return dp[l][i][r];
}

int main() {
  scanf("%d",&n);
  n *= 2;
  g = vvi(n,vi(n));
  rep(i,n) {
    string s;
    cin>>s;
    rep(j,n) g[i][j] = s[j]-'0';
  }
  if (n == 2) {
    int ans = 0;
    if (g[0][1]) ans = 1;
    cout<<ans<<endl;
    return 0;
  }

  rep(i,n) dp[i][i][i] = 1;
  srep(w,2,n)rep(l,n) {
    int r = l+w;
    if (r >= n) continue;
    srep(i,l+1,r) {
      ll& res = dp[l][i][r];
      srep(a,l,i)srep(b,i+1,r+1) if (g[a][b]) {
        srep(x,a,i)srep(y,i,b) {
          ll now = 1;
          now *= dp[l][a][x];
          now *= dp[x+1][i][y];
          now *= dp[y+1][b][r];
          res += now;
        }
      }
    }
  }

  ll ans = 0;
  rep(i,n-1) if (i >= 2) {
    if (g[i][0]) {
      ans += dfs(1,i,n-1);
    }
  }
  cout<<ans<<endl;
  return 0;
}






















Measured memory_bytes: 640