#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T b, T p, T M) {
  long long ret = 1;
  for (; p > 0; p >>= 1) {
    if (p & 1) ret = (ret * b) % M;
    b = (b * b) % M;
  }
  return (T)ret;
}
int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};
int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};
const double PI = acos(-1.0), EPS = 1e-7;
const long long INF = (long long)1e18 + 7;
const int N = 2e5 + 5, M = 1e9 + 7;
int main() {
  long long f[10];
  f[0] = 1;
  for (int i = 1; i < 10; i++) f[i] = f[i - 1] * i;
  long long n;
  cin >> n;
  long long a = 1, b = 1;
  for (int i = 0; i < 5; i++) a *= n + i;
  a /= f[5];
  for (int i = 0; i < 3; i++) b *= n + i;
  b /= f[3];
  cout << a * b << endl;
  return 0;
}
