#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 ans;
ll n;
ll dp[10][605];

void solve() {
	dp[0][0] = 1;
	for (int i = 0; i < 8; i++) {
		for (int j = 0; j <= 6 * n; j++) {
			for (int k = 0; k <= n; k++) {
				if (j - k < 0) continue;
				dp[i + 1][j] += dp[i][j - k];
			}
		}
	}
	cout << dp[8][6 * n] << endl;
}

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