#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b))
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int N;
int E[50][50];
ll dp[50][50][50][50]; //i, j, at, top(when 0, no pair. else, at <= j)
ll sp[50][50][50]; //i, j, at(j < at)
ll ep[50][50];

void solve() {
	cin >> N;
	ep[1][0] = 1;
	// for(int i = 2; i < 2 * N; i++) {
	// 	for(int j = 1; j < 2 * N; j++) {
	// 		for(int k = 1; k < i; k++) {
	// 			for(int e = 0; e < 2 * N; e += 2) {
	// 				ep[i][j] += ep[k][j - 1] * ep[i - k][e];
	// 			}
	// 		}
	// 		debug("ep", i, j, ep[i][j]);
	// 	}
	// }
	// ll ans = 0;
	// for(int e = 0; e < 2 * N; e += 2) {
	// 	ans += ep[2 * N - 1][e];
	// }
	// debug("true", ans);
	rep(i, 0, 2 * N) {
		rep(j, 0, 2 * N) {
			char c; cin >> c;
			E[i][j] = (c == '1');
		}
	}
	rep(i, 1, 2 * N) {
		dp[i][i][0][i] = 1;
		rep(j, i + 1, 2 * N) {
			sp[i][i][j] = E[i][j];
		}
	}
	for(int l = 2; l < 2 * N; l++) {
		for(int i = 1; i < 2 * N; i++) {
			int j = i + l - 1;
			if(j >= 2 * N) continue;
			for(int t = i; t <= j; t++) {
			//0
				for(int at = t + 1; at <= j; at++) {
					for(int ni = i + 1; ni <= t; ni++) {
						dp[i][j][0][t] += dp[ni][j][at][t] * sp[i][ni - 1][at];
						//debug(i, j, 0, t, ni, dp[i][j][0][t], dp[ni][j][at][t], sp[i][ni - 1][t]);
					}
				}
				//debug(i, j, 0, t, dp[i][j][0][t]);
				//at
				for(int at = t + 1; at <= j; at++) {
					for(int nj = t; nj < at; nj++) {
						dp[i][j][at][t] += dp[i][nj][0][t] * dp[nj + 1][j][0][at];
					}
					//debug(i, j, at, t, dp[i][j][at][t]);
				}
			}
		}
		for(int i = 1; i < 2 * N; i++) {
			int j = i + l - 1;
			if(j >= 2 * N) continue;
			for(int t = i; t <= j; t++) {
				for(int u = j + 1; u < 2 * N; u++) {
					sp[i][j][u] += dp[i][j][0][t] * E[u][t];
				}
			}
		}
		for(int i = 1; i < 2 * N; i++) {
			int j = i + l - 1;
			if(j >= 2 * N) continue;
			// for(int u = j + 1; u < 2 * N; u++) {
			// 	debug(i, j, u, sp[i][j][u]);
			// }
		}
	}
	ll res = 0;
	for(int i = 1; i < 2 * N; i++) {
		res += dp[1][2 * N - 1][0][i] * E[0][i];
	}
	cout << res << "\n";
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}



Measured memory_bytes: 39680