#include <bits/stdc++.h>
using namespace std;

long long n;
vector<vector<long long>> com;
vector<vector<long long>> sum;
vector<vector<vector<long long>>> dp;

long long solve();

int main() {
  cin >> n;
  cout << solve() << endl;
  return 0;
}

long long solve() {
  com.resize(9);
  com[0].push_back(1);
  for (int i = 1; i <= 8; ++i) {
    com[i].assign(i + 1, 0);
    for (int j = 0; j < i; ++j) {
      com[i][j] += com[i - 1][j];
      com[i][j + 1] += com[i - 1][j];
    }
  }
  sum.assign(9, vector<long long>(6 * n + 1, 0));
  dp.assign(9, vector(6 * n + 1, vector<long long>(n + 1, 0)));
  dp[0][0][0] = sum[0][0] = 1;
  for (int k = 0; k <= n; ++k) {
    for (int i = 1; i <= 8; ++i)
      for (int j = 0; j <= 6 * n; ++j) {
        int len = i;
        if (k != 0) len = min(len, j / k);
        for (int l = 1; l <= len; ++l)
          dp[i][j][k] += sum[i - l][j - k * l] * com[8 - (i - l)][l];
      }
    for (int i = 1; i <= 8; ++i)
      for (int j = 0; j <= 6 * n; ++j) sum[i][j] += dp[i][j][k];
  }
  return sum[8][6 * n];
}