#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<mint,mint>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long dp[1 << 16][222];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int k; cin >> k;
	vector<int>add(1 << 16);
	rep(i, 1 << 16) {
		int memo[4][4];
		int c = 0;
		rep(j, 16)memo[j / 4][j % 4] = 1 & (i >> j);
		rep(j, 4)rep(k, 4) {
			if ((j < 3) && ((memo[j][k]) != (memo[j + 1][k])))c++;
			if ((k < 3) && ((memo[j][k]) != (memo[j][k + 1])))c++;
		}
		add[i] = c;
	}
	dp[0][0] = 1;
	rep(i, 1 << 16) {
		rep(j, 216 + 1) {
			if (0 == dp[i][j])continue;
			rep(k, 16) {
				if (1 & (i >> k)) continue;
				dp[i + (1 << k)][j + add[i]] += dp[i][j];
			}
		}
	}
	cout << dp[(1 << 16) - 1][k] << endl;
	return 0;
}