#include <iostream>
#include <vector>

using lint = long long;

void solve() {
    int n;
    std::cin >> n;

    std::vector<lint> dp(n * 6 + 1, 0);
    dp[0] = 1;

    for (int q = 0; q < 8; ++q) {
        std::vector<lint> ndp(n * 6 + 1, 0);
        for (int d = 0; d <= n; ++d) {
            for (int x = n * 6; x >= d; --x) {
                ndp[x] += dp[x - d];
            }
        }
        std::swap(dp, ndp);
    }

    std::cout << dp.back() << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}