#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

namespace input {
	template<class T> void re(complex<T>& x);
	template<class T1, class T2> void re(pair<T1,T2>& p);
	template<class T> void re(vector<T>& a);
	template<class T, size_t SZ> void re(array<T,SZ>& a);

	template<class T> void re(T& x) { cin >> x; }
	void re(double& x) { string t; re(t); x = stod(t); }
	void re(ld& x) { string t; re(t); x = stold(t); }
	template<class T, class... Ts> void re(T& t, Ts&... ts) { 
		re(t); re(ts...); 
	}

	template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
	template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
	template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
	template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
	void pr(int x) { cout << x; }
	void pr(long x) { cout << x; }
	void pr(ll x) { cout << x; }
	void pr(unsigned x) { cout << x; }
	void pr(unsigned long x) { cout << x; }
	void pr(unsigned long long x) { cout << x; }
	void pr(float x) { cout << x; }
	void pr(double x) { cout << x; }
	void pr(ld x) { cout << x; }
	void pr(char x) { cout << x; }
	void pr(const char* x) { cout << x; }
	void pr(const string& x) { cout << x; }
	void pr(bool x) { pr(x ? "true" : "false"); }
	
	template<class T1, class T2> void pr(const pair<T1,T2>& x);
	template<class T> void pr(const T& x);
	
	template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
		pr(t); pr(ts...); 
	}
	template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
		pr("{",x.f,", ",x.s,"}"); 
	}
	template<class T> void pr(const T& x) { 
		pr("{"); // const iterator needed for vector<bool>
		bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
		pr("}");
	}
	
	void ps() { pr("\n"); } // print w/ spaces
	template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
		pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
	}
	
	void pc() { pr("]\n"); } // debug w/ commas
	template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
		pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
	}
	#define dbg(x...) pr("[",#x,"] = ["), pc(x);
}

using namespace output;

namespace io {
	void setIn(string s) { freopen(s.c_str(),"r",stdin); }
	void setOut(string s) { freopen(s.c_str(),"w",stdout); }
	void setIO(string s = "") {
		cin.sync_with_stdio(0); cin.tie(0); // fast I/O
		cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
		if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
	}
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
	a %= b; if (a == 0) return b == 1 ? 0 : -1;
	T x = invGeneral(b,a); 
	return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modular {
	T val; 
	explicit operator T() const { return val; }
	modular() { val = 0; }
	modular(const ll& v) { 
		val = (-MOD <= v && v <= MOD) ? v : v % MOD;
		if (val < 0) val += MOD;
	}
	
	// friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
	friend void pr(const modular& a) { pr(a.val); }
	friend void re(modular& a) { ll x; re(x); a = modular(x); }
   
	friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
	friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }
	friend bool operator<(const modular& a, const modular& b) { return a.val < b.val; }

	modular operator-() const { return modular(-val); }
	modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
	modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
	modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
	friend modular pow(modular a, ll p) {
		modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
		return ans;
	}
	friend modular inv(const modular& a) { 
		auto i = invGeneral(a.val,MOD); assert(i != -1);
		return i;
	} // equivalent to return exp(b,MOD-2) if MOD is prime
	modular& operator/=(const modular& m) { return (*this) *= inv(m); }
	
	friend modular operator+(modular a, const modular& b) { return a += b; }
	friend modular operator-(modular a, const modular& b) { return a -= b; }
	friend modular operator*(modular a, const modular& b) { return a *= b; }
	
	friend modular operator/(modular a, const modular& b) { return a /= b; }
};

typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

int N;
string A[40];
ll dp[41][41];
ll ONECROSS[41][41][41][41], SOLVE[41][41][41][41];

int ad(int x, int y) { return (x+y)%(2*N); }
int sub(int x, int y) { return (x-y+2*N)%(2*N); }

ll solve(int a, int sza, int b, int szb);

ll oneCross(int a, int sza, int b, int szb) {
    // ps("HUH",a,b);
    // return 1;
    if (!sza && !szb) return 1;
    if (!sza || !szb) return 0;
    if (!(sza&1) || !(szb&1)) return 0;
    
    if (ONECROSS[a][sza][b][szb] != -1) return ONECROSS[a][sza][b][szb];
    vl aa, bb;
    F0R(i,sza) aa.pb(solve(a,i,ad(a,sza-1),sza-1-i)); 
    F0R(i,szb) bb.pb(solve(sub(b,szb-1),szb-i-1,b,i));
    ll ret = 0;
    F0R(i,sza) F0R(j,szb) if (A[ad(a,i)][sub(b,j)] == '1') 
        ret += aa[i]*bb[j];
    // ps("RET",a,b,ret);
    return ONECROSS[a][sza][b][szb] = ret;
}

ll solve(int a, int sza, int b, int szb) {
    if (SOLVE[a][sza][b][szb] != -1) return SOLVE[a][sza][b][szb];
    ll dp[sza+1][szb+1];
    F0R(j,sza+1) F0R(k,szb+1) dp[j][k] = 0;
    dp[0][0] = 1;
    F0R(j,sza) F0R(k,szb) FOR(J,j+1,sza+1) FOR(K,k+1,szb+1) 
        dp[J][K] += dp[j][k]*oneCross(ad(a,j),J-j,sub(b,k),K-k);
    return SOLVE[a][sza][b][szb] = dp[sza][szb];
}

int match[8];

template<int SZ> struct DSU {
    int par[SZ], sz[SZ];

    DSU() {
        F0R(i,SZ) par[i] = i, sz[i] = 1;
    }

    int get(int x) { // path compression
    	if (par[x] != x) par[x] = get(par[x]);
    	return par[x];
    }

    bool unite(int x, int y) { // union-by-rank
    	x = get(x), y = get(y);
    	if (x == y) return 0;
    	if (sz[x] < sz[y]) swap(x,y);
    	sz[x] += sz[y], par[y] = x;
    	return 1;
    }
};

bool bet(pi a, int b) {
    if (a.f > a.s) swap(a.f,a.s);
    return a.f < b && b < a.s;
}

bool overlap(pi a, pi b) {
    return bet(a,b.f) != bet(a,b.s);
}

/*void dfs() {
    int x = 0; while (x < 8 && match[x] != -1) x ++;
    if (x == 8) {
        vpi ed; F0R(i,8) if (match[i] > i) ed.pb({i,match[i]});
        // ps("??",ed);
        int cnt = 0;
        DSU<4> D = DSU<4>();
        F0R(i,sz(ed)) FOR(j,i+1,sz(ed)) if (overlap(ed[i],ed[j])) {
            if (!D.unite(i,j)) return;
            cnt ++;
        }
        if (cnt == sz(ed)-1) {
            ps("SOL",ed);
        }
        return;
    }
    FOR(y,x+1,8) if (match[y] == -1 && A[x][y] == '1') {
        match[x] = y, match[y] = x;
        dfs();
        match[x] = -1, match[y] = -1;
    }
}*/

int main() {
    F0R(a,41) F0R(b,41) F0R(c,41) F0R(d,41) {
        ONECROSS[a][b][c][d] = -1;
        SOLVE[a][b][c][d] = -1;
    }
	setIO(); re(N); 
	F0R(i,2*N) {
	    re(A[i]);
	    /*F0R(j,2*N) {
	        if (i == j) A[i] += '0';
	        else A[i] += '1';
	    }*/
	}
	// F0R(i,8) match[i] = -1;
	ll ans = 0;
	FOR(i,1,2*N) if (A[0][i] == '1') {
	    // ps("HA",i);
	    ans += solve(1,i-1,2*N-1,2*N-i-1);
	}
	ps(ans);
	// you should actually read the stuff at the bottom
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?), set tle
	* do smth instead of nothing and stay organized
*/


Measured memory_bytes: 44416