// Original C++ solution (slower):
/**

 * code generated by JHelper

 * More info: https://github.com/AlexeyDmitriev/JHelper

 * @author majk

 */



#ifndef MAJK_LIB

#define MAJK_LIB



#include <vector>

#include <stack>

#include <iostream>

#include <unordered_map>

#include <unordered_set>

#include <map>

#include <iomanip>

#include <set>

#include <functional>

#include <algorithm>

#include <numeric>

#include <cassert>

#include <cmath>

#include <string>

#include <queue>

#include <array>

#include <bitset>

using namespace std;



#define x first

#define y second

typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;



template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}

template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}

template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.x << ' ' << p.y; return o;}

template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}

template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;

template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;

ui logceil(ll x) { return x?8*sizeof(ll)-__builtin_clzll(x):0; }



namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }

template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}

template<typename F> double bshd(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){l=m;}else{h=m;}}return (l+h)/2;}

template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}

template<typename F> double bsld(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){h=m;}else{l=m;}}return (l+h)/2;}

template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }





template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};

template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};

template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};

template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};





#endif



class EPairingPoints {

public:

    void solve(istream& cin, ostream& cout) {

        int N; cin >> N;

        N *= 2;

        vector2<bool> E(2*N, 2*N);

        for (int i = 0; i < N; ++i) {

            string S; cin >> S;

            for (int j = 0; j < N; ++j) {

                E[i][j] = E[i][j+N] = E[i+N][j] = E[i+N][j+N] = S[j] == '1';

            }

        }



        vector3<ll> D(N, 2*N+1, 2*N+1, 0);

        for (int i = 0; i < 2*N-1; ++i) D[1][i][i] = 1;

        for (int len = 3; len < N; len += 2) {

            for (int x1 = 0; x1 + len <= 2 * N; ++x1) {

                for (int l1 = 1; l1 < len; l1 += 2) {

                    for (int c1 = x1; c1 < x1 + l1; ++c1) {

                        if (D[l1][x1][c1] == 0) continue;

                        int x2 = x1 + l1;

                        for (int l2 = 1; l2 + l1 < len; l2 += 2) {

                            for (int c2 = x1 + l1; c2 < x2 + l2; ++c2) {

                                if (D[l2][x2][c2] == 0) continue;

                                int x3 = x2 + l2;

                                int l3 = len - l1 - l2;

                                for (int c3 = x3; c3 < x3 + l3; ++c3) {

                                    if (E[c1][c3]) {

                                        D[len][x1][c2] += D[l1][x1][c1] * D[l2][x2][c2] * D[l3][x3][c3];

                                    }

                                }

                            }

                        }

                    }

                }

            }

        }



        ll ans = 0;

        for (int leftCenter = 0; leftCenter < N - 1; ++leftCenter) {

            if (E[leftCenter][N-1] && D[N-1][0][leftCenter]) {

                ans += D[N-1][0][leftCenter];

            }

        }



        cout << ans << endl;

    }

};





int main() {

	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

	EPairingPoints solver;

	std::istream& in(std::cin);

	std::ostream& out(std::cout);

	solver.solve(in, out);

    return 0;

}


// Optimized solution to the same problem (faster):
/**

 * code generated by JHelper

 * More info: https://github.com/AlexeyDmitriev/JHelper

 * @author majk

 */



#ifndef MAJK_LIB

#define MAJK_LIB



#include <vector>

#include <stack>

#include <iostream>

#include <unordered_map>

#include <unordered_set>

#include <map>

#include <iomanip>

#include <set>

#include <functional>

#include <algorithm>

#include <numeric>

#include <cassert>

#include <cmath>

#include <string>

#include <queue>

#include <array>

#include <bitset>

using namespace std;



#define x first

#define y second

typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;



template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}

template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}

template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.x << ' ' << p.y; return o;}

template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}

template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;

template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;

ui logceil(ll x) { return x?8*sizeof(ll)-__builtin_clzll(x):0; }



namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }

template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}

template<typename F> double bshd(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){l=m;}else{h=m;}}return (l+h)/2;}

template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}

template<typename F> double bsld(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){h=m;}else{l=m;}}return (l+h)/2;}

template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }





template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};

template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};

template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};

template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};





#endif



class EPairingPoints {

public:

    void solve(istream& cin, ostream& cout) {

        int N; cin >> N;

        N *= 2;

        vector2<bool> E(2*N, 2*N);

        for (int i = 0; i < N; ++i) {

            string S; cin >> S;

            for (int j = 0; j < N; ++j) {

                E[i][j] = E[i][j+N] = E[i+N][j] = E[i+N][j+N] = S[j] == '1';

            }

        }



        vector3<ll> D(N, N+1, N+1, 0);

        for (int i = 0; i < N; ++i) D[1][i][i] = 1;

        for (int len = 3; len < N; len += 2) {

            for (int x1 = 0; x1 + len <= N; ++x1) {

                for (int l1 = 1; l1 < len; l1 += 2) {

                    for (int c1 = x1; c1 < x1 + l1; ++c1) {

                        if (D[l1][x1][c1] == 0) continue;

                        int x2 = x1 + l1;

                        for (int l2 = 1; l2 + l1 < len; l2 += 2) {

                            int x3 = x2 + l2;

                            int l3 = len - l1 - l2;

                            for (int c3 = x3; c3 < x3 + l3; ++c3) {

                                if (D[l3][x3][c3] && E[c1][c3]) {

                                    for (int c2 = x1 + l1; c2 < x2 + l2; ++c2) {

                                        D[len][x1][c2] += D[l1][x1][c1] * D[l2][x2][c2] * D[l3][x3][c3];

                                    }

                                }

                            }

                        }

                    }

                }

            }

        }



        ll ans = 0;

        for (int leftCenter = 0; leftCenter < N - 1; ++leftCenter) {

            if (E[leftCenter][N-1] && D[N-1][0][leftCenter]) {

                ans += D[N-1][0][leftCenter];

            }

        }



        cout << ans << endl;

    }

};





int main() {

	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

	EPairingPoints solver;

	std::istream& in(std::cin);

	std::ostream& out(std::cout);

	solver.solve(in, out);

    return 0;

}


// Fastest known solution for this problem: