#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (ll i=(ll)N-1; i>=0; i--)
#define popcount __builtin_popcount

const ll LLINF = pow(2,61)-1;
const ll INF = pow(2,30)-1;

ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

int main() {
  ll K; cin >> K;
  ll N = 4, N2 = N*N , MA = 216;
  vector<vector<ll>> dp(1<<N2,vector<ll>(MA+1)); dp[0][0] = 1;
  rep(i,1<<N2) {
    vector<vector<bool>> used(N, vector<bool>(N));
    rep(j,N2) used[j/N][j%N] = i>>j&1;
    ll pls = 0;
    rep(h,N) rep(w,N-1) pls += used[h][w]^used[h][w+1];
    rep(h,N-1) rep(w,N) pls += used[h][w]^used[h+1][w];
    // cout << pls << endl; rep(j,N) debug(all(used[j])); cout << endl;
    rep(j,N2) {
      if ((i&1<<j)) continue;
      rep(k,MA+1-pls) dp[i^1<<j][k+pls] += dp[i][k];
    }
  }
  // debug(all(dp[(1<<N2)-1]));
  ll result = dp[(1<<N2)-1][K];
  cout << result << endl;
  return 0;
}