#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
main(){
    ll N;
    cin >> N;
    ll dp[9][N*6+10];
    rep(i,0,9)rep(j,0,N*6+10)dp[i][j] = 0;
    dp[0][0] = 1;
    rep(i,0,8){
        rep(j,0,N*6+1){
            rep(k,0,N+1){
                if(j + k > N*6)break;
                dp[i+1][j+k] += dp[i][j];
            }
        }
    }
    cout << dp[8][N*6] << endl;
}