#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;

#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)

template<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}
template<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}
struct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);cerr<<fixed<<setprecision(15);}}init_;

#ifdef DEBUG
template <class T> void verr(const set<T> &st) { repa(a, st) cerr << a << " "; cerr << endl; }
template <class S, class T> void verr(const map<S, T> &mp) { repa(a, mp) cerr << "{" << a.first << ", " << a.second << "} "; cerr << endl; }
template <class S, class T, class N> void verr(const vector<pair<S,T>>& a, const N& n) { rep(i, n) cerr << "{" << a[i].first << ", " << a[i].second << "} "; cerr << endl; }
template <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << " "; cerr << endl; }
ll dbgt = 1; void err() { cerr << "passed " << dbgt++ << endl; }
template<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif

const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//

int main() {
    ll K;
    cin >> K;
    vvc<ll> dp(K + 1, vl(1 << 16));
    dp[0][0] = 1;

    vl dh = {0, 0, 1, -1}, dw = {1, -1, 0, 0};
    rep(bit, (1 << 16) - 1){
        rep(k, K + 1){
            if (dp[k][bit] == 0) continue;
            ll dcnt = 0;
            rep(i, 16){
                if (!(bit >> i & 1)) continue;
                ll h = i / 4, w = i % 4;
                rep(d, 4) {
                    ll th = h + dh[d], tw = w + dw[d];
                    if (th < 0 or th >= 4 or tw < 0 or tw >= 4) continue;
                    if (bit >> (th * 4 + tw) & 1) continue;
                    dcnt++;
                }
            }
            rep(i, 16){
                if (bit >> i & 1) continue;
                ll h = i / 4, w = i % 4, tocnt = dcnt;
                rep(d, 4) {
                    ll th = h + dh[d], tw = w + dw[d];
                    if (th < 0 or th >= 4 or tw < 0 or tw >= 4) continue;
                    if (bit >> (th * 4 + tw) & 1) {
                        tocnt--;
                    }else{
                        tocnt++;
                    }
                }
                if (k + tocnt <= K) dp[k + tocnt][bit | 1 << i] += dp[k][bit];
            }
        }
    }

    cout << dp[K][(1 << 16) - 1] << endl;
}