#include <iostream>
using namespace std;

typedef long long ll;

const int kMAX_N = 110;
ll dp[10][kMAX_N * 6];

int main() {
    int n;
    cin >> n;
    
    dp[0][0]= 1;
    for (int i = 0; i < 8; i++) {
        for (int sum = 0; sum <= n * 6; sum++) {
            if (dp[i][sum] == 0) continue;

            for (int val = 0; val <= n; val++) {
                if (sum + val > n * 6) break;
                dp[i + 1][sum + val] += dp[i][sum];
            }
        }
    }
    cout << dp[8][6 * n] << endl;

    return 0;
}