#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

int main() {
    int n; cin >> n;
    vector<vector<ll>> dp(8 + 1, vector<ll>(8 * n + 1, 0));
    dp[0][0] = 1;
    for (int i = 1; i <= 8; i++) {
        for (int j = 0; j <= n * 6; j++) {
            for (int k = 0; k <= n; k++) {
                if (j - k >= 0) dp[i][j] += dp[i - 1][j - k];
            }
        }
    }
    cout << dp[8][n * 6] << endl;
    return 0;
}