#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
ll dp[216*2+1][1<<16];
int main()
{
    int K; cin>>K;
    int n=16, d=4;
    dp[K][0]=1;
    int dx[4]={1,-1,0,0}, dy[4]={0,0,1,-1};
    for(int i=0; i<(1<<n); i++){
        int p=popcount(i);
        for(int j=0; j<n; j++){
            if(i&(1<<j)) continue;
            int x=(j>>2), y=(j&3), t=0;
            for(int k=0; k<4; k++){
                int x1=x+dx[k], y1=y+dy[k];
                if(x1<0 || x1>=d || y1<0 || y1>=d) continue;
                int j1=((x1<<2)^y1);
                if(i&(1<<j1)) t++;
                else t--;
            }
            for(int k=0; k<=2*K; k++){
                if(!dp[k][i]) continue;
                int k1=k+p*t;
                if(k1>=0 && k1<=2*K){
                    dp[k1][i^(1<<j)]+=dp[k][i];
                }
            }
        }
    }
    cout<<dp[2*K][(1<<n)-1]<<endl;
    return 0;
}