#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 555, M = 10;
int n;
ll mem[N][M];
ll dp(int i, int m) {
  if (m == 0) return 1;
  if (i == n) return 0;
  if (mem[i][m] != -1) return mem[i][m];
  ll ans = 0;
  for (int j = 0; j <= m; j++) {
    ans += dp(i + 1, m - j);
  }
  return mem[i][m] = ans;
}
int main() {
  scanf("%d", &n);
  memset(mem, -1, sizeof mem);
  cout << dp(0, 5) * dp(0, 3) << endl;
}
