#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

int main() {
  int n;
  cin >> n;

  int n6 = n * 6;
  vector<ll> dp(n6 + 1);
  dp[0] = 1;
  rep(i, 8) {
    vector<ll> p(n6 + 1);
    swap(dp, p);
    rep(j, n + 1) {
      rep(k, n6 + 1) {

        if (j + k > n6) break;
        dp[j + k] += p[k];
      }
    }
  }
  cout << dp[n6] << endl;
  return 0;
}