#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
template<class T> void print_tate(vector<T> &v) {rep(i,v.size()) cout<<v[i]<<"\n";}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



//おちこんだりもしたけれど、私はげんきです。
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int K;
	cin>>K;

	vector<vector<ll>> dp((1<<16),vector<ll>(400));
	dp[0][0]=1;
	rep(i,(1<<16)){
		ll X=16;
		rep(j,16){
			if(i&(1<<j)) X--;
		}
		if(X==0) break;
		rep(k,16){
			if(i&(1<<k)) continue;
			int A=0;
			if(k%4!=0){
				A+=1;
				if(i&(1<<(k-1))) A-=2;
			}
			if(k%4!=3){
				A+=1;
				if(i&(1<<(k+1))) A-=2;
			}
			if(k>=4){
				A+=1;
				if(i&(1<<(k-4))) A-=2;
			}
			if(k<12){
				A+=1;
				if(i&(1<<(k+4))) A-=2;
			}
			A*=X;
			//if(i==0) cout<<A<<endl;
			for(int j=min(0,A);j<440-max(0,A);j++){
				//if(dp[i][j]!=0) cout<<dp[i][j]<<" "<<i<<" "<<j<<endl;
				dp[(i|(1<<k))][j+A]+=dp[i][j];
			}
		}
		//cout<<i<<endl;
	}
	cout<<dp[65535][K]<<endl;
	//rep(i,400) cout<<dp[65535][i]<<endl;
}