#include <bits/stdc++.h>

#define For(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rFor(i, a, b) for (int i = (int)(a)-1; i >= (int)(b); --i)
#define rep(i, n) For(i, 0, (n))
#define rrep(i, n) rFor(i, (n), 0)
#define fi first
#define se second

using namespace std;

typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;

template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

template <typename T>
struct coord_comp {
    vector<T> v;
    bool sorted = false;

    coord_comp() {}

    int size() { return v.size(); }

    void add(T x) { v.push_back(x); }

    void build() {
        sort(v.begin(), v.end());

        v.erase(unique(v.begin(), v.end()), v.end());
        sorted = true;
    }

    int get_idx(T x) {
        assert(sorted);
        return lower_bound(v.begin(), v.end(), x) - v.begin();
    }

    T &operator[](int i) { return v[i]; }
};

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};

int idx(int x, int y) { return x * 4 + y; }

lint dp[1 << 16][440];
int offset = 220;

int main() {
    int K;
    scanf("%d", &K);

    dp[0][offset] = 1;
    rep(S, 1 << 16) rep(score, 440) if (dp[S][score]) {
        rep(x, 4) rep(y, 4) {
            int i = idx(x, y);
            if (S >> i & 1) continue;
            int coef = 0;
            rep(k, 4) {
                int nx = x + dx[k], ny = y + dy[k];
                if (nx < 0 || 4 <= nx || ny < 0 || 4 <= ny) continue;
                if (S >> idx(nx, ny) & 1)
                    ++coef;
                else
                    --coef;
            }
            dp[S | (1 << i)][score + coef * __builtin_popcount(S)] +=
                dp[S][score];
        }
    }
    printf("%lld\n", dp[(1 << 16) - 1][offset + K]);
}