#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int N = 4;
  int k; cin >> k;
  vector dp(1 << (N * N), vector(k + 1, 0LL));
  dp[0][0] = 1;
  REP(v, N * N) {
    vector nx(1 << (N * N), vector(k + 1, 0LL));
    REP(b, 1 << (N * N)) {
      bool is_fixed[N][N]{};
      REP(i, N) REP(j, N) is_fixed[i][j] = b >> (i * N + j) & 1;
      REP(y, N) REP(x, N) {
        if (is_fixed[y][x]) continue;
        is_fixed[y][x] = true;
        int add = 0;
        FOR(i, 1, N) REP(j, N) add += is_fixed[i - 1][j] ^ is_fixed[i][j];
        REP(i, N) FOR(j, 1, N) add += is_fixed[i][j - 1] ^ is_fixed[i][j];
        is_fixed[y][x] = false;
        int nb = b | (1 << (y * N + x));
        for (int score = 0; score + add <= k; ++score) {
          nx[nb][score + add] += dp[b][score];
        }
      }
    }
    dp.swap(nx);
  }
  cout << dp[(1 << (N * N)) - 1][k] << '\n';
  return 0;
}