#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

template<class T>
ostream& operator << (ostream& os, vector<T> vec){
	for(int i=0; i<vec.size(); i++){
		os << vec[i] << " ";
	}
	return os;
}

int main(){
	int n;
	cin >> n;

	vector<long long> dp(6*n+1, 0);
	fill(dp.begin(), dp.begin()+n+1, 1);

	for(int i=1; i<8; i++){
		vector<long long> dp_(6*n+1, 0);
		long long len = 0;
		long long sum = 0;
		for(int j=0; j<=6*n; j++){
			if(len>n){
				sum -= dp[j-n-1];
				len--;
			}
			sum += dp[j];
			len++;
			dp_[j] += sum;
		}
		swap(dp,dp_);

		//cerr << dp << endl;
	}

	cout << dp[6*n] << endl;
	return 0;
}