#include <atcoder/all>
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace atcoder;
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ull MOD = 1000000007;
using mll = static_modint<1000000007>;
#define rep(i,n) for(int i=0; i<(n); i++)

int C[1<<16];
ll dp[361][1<<16] = {};
vector<int> E[16];

int main(){
  C[0] = 0;
  rep(i,16) rep(j,1<<i) C[j+(1<<i)] = C[j] + 1;
  rep(y,4) rep(x,3) E[y*4+x].push_back(y*4+x+1);
  rep(y,4) rep(x,3) E[y*4+x+1].push_back(y*4+x);
  rep(y,3) rep(x,4) E[y*4+x].push_back(y*4+x+4);
  rep(y,3) rep(x,4) E[y*4+x+4].push_back(y*4+x);
  dp[0][0] = 1;
  rep(i,1<<16) rep(nx,16) if(0==(i&(1<<nx))){
    ll dx = 0;
    int c = 15 - C[i];
    for(int e : E[nx]){
      if(i&(1<<e)) dx -= c;
      else dx += c;
    }
    rep(k,361){
      if(k + dx < 0 || 360 < k + dx) continue;
      dp[k+dx][i|(1<<nx)] += dp[k][i];
    }
  }
  
  int K; cin >> K;
  cout << dp[K][(1<<16)-1] << endl;
  return 0;
}

struct ios_do_not_sync{
  ios_do_not_sync(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
  }
} ios_do_not_sync_inst;