Problem: Because of budget cuts one IT company established new non-financial reward system instead of bonuses.

Two kinds of actions are rewarded: fixing critical bugs and suggesting new interesting features. A man who fixed a critical bug gets "I fixed a critical bug" pennant on his table. A man who suggested a new interesting feature gets "I suggested a new feature" pennant on his table.

Because of the limited budget of the new reward system only 5 "I fixed a critical bug" pennants and 3 "I suggested a new feature" pennants were bought.

In order to use these pennants for a long time they were made challenge ones. When a man fixes a new critical bug one of the earlier awarded "I fixed a critical bug" pennants is passed on to his table. When a man suggests a new interesting feature one of the earlier awarded "I suggested a new feature" pennants is passed on to his table.

One man can have several pennants of one type and of course he can have pennants of both types on his table. There are n tables in the IT company. Find the number of ways to place the pennants on these tables given that each pennant is situated on one of the tables and each table is big enough to contain any number of pennants.

Input

The only line of the input contains one integer n (1 ≤ n ≤ 500) — the number of tables in the IT company.

Output

Output one integer — the amount of ways to place the pennants on n tables.

Examples

Input

2


Output

24

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long qpow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return ans;
}
long long inverse(long long a) { return qpow(a, MOD - 2) % MOD; }
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int extend_gcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    int r = extend_gcd(b, a % b, y, x);
    y -= x * (a / b);
    return r;
  }
}
int main() {
  int n, i, j, k;
  int jj, kk;
  unsigned long long f[505][15][15] = {0};
  scanf("%d", &n);
  f[0][0][0] = 1;
  for (i = 1; i <= n; i++)
    for (j = 0; j <= 3; j++)
      for (k = 0; k <= 5; k++) {
        for (jj = 0; jj <= j; jj++)
          for (kk = 0; kk <= k; kk++) f[i][j][k] += f[i - 1][jj][kk];
      }
  cout << f[n][3][5] << endl;
  return 0;
}