#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#include <bitset>
#include <complex>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)
#define EPS (1e-14)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef complex<double> Complex;
typedef vector< vector<int> > Mat;

ll freq[605];
ll n ;
ll ans;

ll calc(ll x) {
	ll res = 0;
	for (ll i = 0; i <= x; i++) {
		ll a = 0, b = 0;
		res += freq[i] * freq[x - i];
	}
	return res;
}

void solve() {
	ans = 0;
	memset(freq, 0, sizeof(freq));
	for (int i = 0; i <= n; i++) {
		for (int j = 0; j <= n; j++) {
			freq[i + j]++;
		}
	}
	for (ll i = 0; i <= 6 * n; i++) {
		ll efgh = i;
		ll a = calc(efgh);
		ll abcd = 6 * n - i;
		ll b = calc(abcd);
		ans += a * b;
	}
	cout << ans << endl;
}

int main() {
	while (cin >> n) {
		solve();
	}
	return 0;
}