#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;
 
const int inf = (int)1e9; 
 
ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

ll dp[100];
ll c[600];

int main(void){
	int n;
	cin>>n;
	map<int,ll>mp1;
	for(int i=0;i<=n;i++){
		for(int j=0;j<=n;j++){
			for(int k=0;k<=n;k++){
				for(int l=0;l<=n;l++){
					c[i+j+k+l]++;
				}
			}
		}
	}
	ll ans = 0;
	for(int i=0;i<=400;i++){
		int num = 6*n-i;
		if(6*n<num)continue;
		else ans+=c[i]*c[num];
	}
	cout<<ans<<endl;
	return 0;
}