#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <tuple>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1);

int n;

ll dp[5][410];

ll calc(int v, int k) {
    if (dp[v][k] < 0) {
        if (v == 0 && k == 0) {
            dp[v][k] = 1;
        } else if (v*n < k) {
            dp[v][k] = 0;
        } else {
            ll res = 0;
            for (int i = 0; i <= min(k, n); i++) {
                res += calc(v-1, k-i);
            }
            dp[v][k] = res;
        }
    }
    return dp[v][k];
}

ll solve() {
    memset(dp, -1, sizeof(dp));
    for (int i = 2*n; i <= n*4; i++) {
        calc(4, i);
    }
    ll res = 0;
    for (int i = 2*n; i <= 4*n; i++) {
        res += dp[4][i] * dp[4][6*n-i];
    }
    return res;
}

void input() {
    cin >> n;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    cout << solve() << endl;
}