#include <bits/stdc++.h>
using namespace std;
long long int fact[1000000];
long long int inv[1000000];
long long binpow(long long int a, long long int b, long long int m) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % m;
    a = ((a % m) * (a % m)) % m;
    b >>= 1;
  }
  return res;
}
void cal1() {
  fact[0] = 1;
  for (long long int i = 1; i < 1000000; i++) {
    fact[i] = (fact[i - 1] * i) % 1000000007;
  }
  for (long long int i = 0; i < 1000000; i++) {
    inv[i] = binpow(fact[i], 1000000007 - 2, 1000000007);
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t = 1;
  while (t--) {
    cal1();
    long long int n;
    cin >> n;
    long long int an = ((n + 4) * (n + 3) * (n + 2) * (n + 1) * (n)) / 120;
    long long int an1 =
        (((fact[n - 1 + 3] * inv[n - 1]) % 1000000007) * inv[3]) % 1000000007;
    cout << (an * an1);
  }
  return 0;
}
