#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional> 
#include <iomanip>
#include <unordered_map>
#include <memory.h>
#include <unordered_set>
#include <fstream>
#include <random>

using namespace std;

long long int dp[9][601];
int main(void)
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n;

	cin >> n;

	memset(dp, 0, sizeof(dp));
	dp[0][0] = 1;

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

	cout << dp[8][6 * n] << '\n';

	return 0;
}