#include <bits/stdc++.h>
#include <windows.h>

typedef long long ll;

using namespace std;

const ll N = 30;
const ll C = N/2;
const ll R = N+1;
ll STATE;

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

void calculate(int mode){
    for(long long int i=0; i<N*C; i++){
        row=i/C, col=i%C;
        int rrow = (row<C?row:N-1-row), rrow2 = (row+1<C?row+1:N-row-2);
        for(long long int j=0; j<STATE; j++){
            if(D[i][j]){
                bit=j>>1;
                if((row<C && row+col+1<C) ||
                   (row>=C && row-C)){
                    D[i+1][bit] += D[i][j];
                    continue;
                }
                if(col == C-1 && (mode & (1 << rrow))){
                    D[i+1][bit] += D[i][j];
                    continue;
                }
                if(bit&1) D[i+1][bit] += D[i][j];
                else{
                    if(!(bit&2) && col<C-1 &&
                       (col < C-2 || (mode & (1 << rrow)))){
                        D[i+1][bit|3]+=D[i][j];
                    }
                    if(row-C < col &&
                       (col != C-1 || !(mode & (1 << (rrow2))))){
                        D[i+1][bit|1|(1<<C)] += D[i][j];
                    }
                }
            }
        }
    }
    for(int i=0; i<STATE; i++){
        ans += D[N*C][i];
    }
}

int main(){
    STATE = (1<<(C+1));
    for(int i=0; i<(1<<C); i++){
        calculate(i);
        memset(D, 0, sizeof(D));
        D[0][0] = 1;
    }
    printf("%lld", ans);
}