#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcountll
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr int inf = 1e9;
constexpr ll INF = 1e18;
//using mint = modint1000000007;
using mint = modint998244353;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0,-1};

int main(){
    int K;
    cin >> K;
    const int n = 4;
    const int n2 = n*n;
    vector<vector<ll>> dp(1<<n2,vector<ll>(K+1));
    dp[0][0] = 1;
    rep(j,1<<n2){
        rep(k,n2){
            //今の状態がj,今のスコアがs
            if(j>>k&1) continue;
            
            //場所kに追加する
            int ad = 0;
            int nextstate = j;
            nextstate |= 1<<k;
            rep(ni,n)rep(nj,n){
                {
                    int nni = ni+1;
                    int nnj = nj;
                    if(nni < n && nnj < n){
                        if((nextstate>>(ni*n+nj)&1) ^ (nextstate>>(nni*n+nnj)&1)) ad++;
                    }
                }
                {
                    int nni = ni;
                    int nnj = nj+1;
                    if(nni < n && nnj < n){
                        if((nextstate>>(ni*n+nj)&1) ^ (nextstate>>(nni*n+nnj)&1)) ad++;
                    }
                }
            }
            
            rep(s,K+1){
                if(s+ad <= K) dp[nextstate][s+ad] += dp[j][s];
            }
        }
    }
    ll ans = dp[(1<<n2)-1][K];
    out(ans);
}