#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;

template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

const int H=4,W=4;
const int N=16;
const int T=217;

signed main(){
    vector<int> add(1<<N,0);
    rep(bit,1<<N){
        rep(i,4)rep(j,4){
            int num=i*4+j;
            if((bit>>num)&1){
                rep(k,4){
                    int ni=i+dx[k],nj=j+dy[k];
                    int nnum=ni*4+nj;
                    if(0<=ni and ni<4 and 0<=nj and nj<4){
                        if(!((bit>>nnum)&1)) add[bit]++;
                    }
                }
            }
        }
    }

    vector<vector<ll>> dp(1<<N,vector<ll>(T,0));
    dp[0][0]=1;

    for(int bit=0;bit<(1<<N);bit++){
        for(int num=0;num<16;num++){
            if((bit>>num)&1) continue;
            int nxt=bit|(1<<num);
            int p=add[nxt];
            rep(t,T)if(p+t<T) dp[nxt][t+p]+=dp[bit][t];
        }
    }

    int K;cin>>K;
    cout<<dp[(1<<N)-1][K]<<endl;
    return 0;
}