#include <bits/stdc++.h>
#include <windows.h>
#define N 15

typedef long long ll;

using namespace std;

const ll C = N;
const ll R = N+1;
ll STATE;

ll D[R*R][(1<<(R+1))]={{1}};
ll row, col;
ll bit;
ll ans;

int main(){
    STATE = (1<<(C+1));
    for(long long int i=0; i<N*N; i++){
        row=i/C, col=i%C;
        for(long long int j=0; j<STATE; j++){
            if(D[i][j]){
                bit=j>>1;
                if(row+col+1<N){
                    D[i+1][bit] += D[i][j];
                    continue;
                }
                if(bit&1) D[i+1][bit] += D[i][j];
                else{
                    if(col == N-1){
                        D[i+1][bit|1]+=D[i][j];
                    }
                    if(!(bit&2) && col<N-1){
                        D[i+1][bit|3]+=D[i][j];
                    }
                    D[i+1][bit|1|(1<<C)] += D[i][j];
                }
            }
        }
    }
    for(int i=0; i<STATE; i++){
        ans += D[N*N][i];
    }
    printf("%lld", ans/2);
}