#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>

using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max = (n); i < i##_max; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##min = (a); i >= i##min; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "BinaryMatrix.h"
#include "Bipartite.h"
#include "BIT.h"
#include "DynamicMod.h"
#include "Factorization.h"
#include "FFT.h"
#include "FlowSolver.h"
#include "Graph.h"
#include "LazySegmentTree.h"
#include "Math.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Position.h"
#include "Range.h"
#include "Rational.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "SuffixArray.h"
#include "Tree.h"
#include "UnionFind.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>> (istream& ist, __int128& val) { LL tmp;  ist >> tmp; val = tmp; return ist; }
ostream& operator<< (ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

int N;
string S[40];
LL memo[40][80][80];
bool used[40][80][80];
LL sub(int l, int r, int k) {
	if (l >= N) return sub(l - N, r - N, k - N);
	if (r - l == 1) return 1;
	if ((r - l) % 2 == 0) return 0;
	if (used[l][r][k]) return memo[l][r][k];
	LL ans = 0;

	REP(ml, l + 1, k + 1) {
		if ((ml - l) % 2 == 0) continue;
		REP(mr, k + 1, r) {
			if ((r - mr) % 2 == 0) continue;
			// [l, ml) [ml, mr) [mr, r)
			REP(kl, l, ml) {
				REP(kr, mr, r) {
					if (S[kl % N][kr % N] == '0') continue;
					ans += sub(l, ml, kl) * sub(ml, mr, k) * sub(mr, r, kr);
				}
			}
		}
	}

	used[l][r][k] = true;
	memo[l][r][k] = ans;
	return ans;
}

LL solve() {
	LL sum = 0;
	REP(l, 0, N) {
		REP(r, l + 1, l + N) {
			if ((r - l) % 2 == 0) continue;
			REP(kl, l, r) {
				REP(kr, r, l + N) {
					if (S[kl % N][kr % N] == '0') continue;
					sum += sub(l, r, kl) * sub(r, l + N, kr);
				}
			}
		}
	}
	return sum / (3 * N - 4);
}

int main() {
	cin >> N;
	N *= 2;
	REP(i, 0, N) cin >> S[i];

	LL ans = solve();
	cout << ans << endl;
	return 0;
}



Measured memory_bytes: 1536