/*
Author: QAQAutomaton
Lang: C++
Code: E.cpp 
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define int long long
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int inf;
const double eps=1e-8;
const double pi=acos(-1.0);
template<class T>int chkmin(T &a,T b){return a>b?a=b,1:0;}
template<class T>int chkmax(T &a,T b){return a<b?a=b,1:0;}
template<class T>T sqr(T a){return a*a;}
template<class T>T mmin(T a,T b){return a<b?a:b;}
template<class T>T mmax(T a,T b){return a>b?a:b;}
template<class T>T aabs(T a){return a<0?-a:a;}
template<class T>int dcmp(T a,T b){return a>b;}
template<int *a>int cmp_a(int x,int y){return a[x]<a[y];}
#define min mmin
#define max mmax
#define abs aabs
struct __INIT__{
	__INIT__(){
		memset(&inf,0x3f,sizeof(inf));
	}
}__INIT___;
namespace io {
	const int SIZE = (1 << 21) + 1;
	char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
	// getchar
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	// print the remaining part
	inline void flush () {
		fwrite (obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	// putchar
	inline void putc (char x) {
		*oS ++ = x;
		if (oS == oT) flush ();
	}
	template<typename A>
	inline bool read (A &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}
	inline bool read (char &x) {
		while((x=gc())==' '||x=='\n' || x=='\r');
		return x!=EOF;
	}
	inline bool read(char *x){
		while((*x=gc())=='\n' || *x==' '||*x=='\r');
		if(*x==EOF)return 0;
		while(!(*x=='\n'||*x=='\r'))*(++x)=gc();
		*x=0;
		return 1;
	}
	template<typename A,typename ...B>
	inline bool read(A &x,B &...y){
		return read(x)&&read(y...);
	}
	template<typename A>
	inline bool write (A x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}
	inline bool write (char x) {
		putc(x);
		return 0;
	}
	inline bool write(const char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	inline bool write(char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	template<typename A,typename ...B>
	inline bool write(A x,B ...y){
		return write(x)||write(y...);
	}
	//no need to call flush at the end manually!
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: read;
using io :: putc;
using io :: write;
int n;
bitset<41> a[41];
int f[41][41][41];
bool vis[41][41];
int dp[41][41][41],t; 
bool visx[41][41][41][41];
int v[41][41][41][41];
void calc(int,int);
int getv(int,int,int,int);
int getv(int l1,int r1,int l2,int r2){
	if(visx[l1][r1][l2][r2])return v[l1][r1][l2][r2];
	visx[l1][r1][l2][r2]=1;
	int w=0;
	calc(l1,r1);
	calc(l2,r2);
	for(int i=l1;i<=r1;++i)for(int j=l2;j<=r2;++j)if(a[i][j])w+=f[l1][r1][i]*f[l2][r2][j];
	return v[l1][r1][l2][r2]=w;
}
void calc(int l,int r){
	if(vis[l][r])return;
	vis[l][r]=1;
	if(l==r){f[l][l][l]=1;return;}	
	++t;
	dp[t][l-1][r+1]=1;
	for(int i=l;i<r;++i)for(int j=r;i<j;--j){
		for(int k=l;k<=i;++k)for(int m=r;m>=j;--m){
			dp[t][i][j]+=dp[t][k-1][m+1]*getv(k,i,j,m);
		}
	}	
	for(int i=l;i<=r;++i)f[l][r][i]=dp[t][i-1][i+1];
	dp[t][l-1][r+1]=0;
	for(int i=l;i<r;++i)for(int j=r;i<j;--j){
		dp[t][i][j]=0;
	}
	--t;
}
signed main(){
#ifdef QAQAutoMaton 
	freopen("E.in","r",stdin);
	freopen("E.out","w",stdout);
#endif
	read(n);
	n<<=1;
	char c;
	for(int i=0;i<n;++i){
		for(int j=0;j<n;++j){
			read(c);
			a[i][j]=c-'0';
		}
	}
	calc(1,n-1);
	int ans=0;
	for(int i=1;i<n;++i)if (a[0][i])ans+=f[1][n-1][i];
	write(ans,'\n');
	return 0;
}



Measured memory_bytes: 27904