#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

unsigned long long C[1000+1][1000+1];

unsigned long long rnomial(int r, int n, int k) {
	if(r == 0) return n == 0 && k == 0 ? 1 : 0;
	if(k == 0) return 1;
	if(n == 0) return 0;
	unsigned long long sum = 0;
	int imax = k/r;
	if(imax > n) return 0;
	rer(i, 0, imax) {
		unsigned long long t = C[n][i] * C[n+k-1-r*i][n-1];
		if(i % 2 == 0) sum += t; else sum -= t;
	}
	return sum;
}

int main() {
	const int Combination_N = 1000;
	for(int i = 0; i <= Combination_N; i ++) {
		C[i][0] = 1;
		for(int j = 1; j <= i; j ++)
			C[i][j] = C[i-1][j-1] + C[i-1][j];
	}
	int n;
	while(cin >> n) {
		ll ans = rnomial(n+1, 8, 6 * n);
		cout << ans << endl;
	}
	return 0;
}