#include <cstdio>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <iomanip>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()

using namespace std;
typedef long long ll;

const int MAX_N = 1010;
ll dp[10][1010];
int n;

int main(int argc, char *argv[])
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin >> n;
  dp[0][0] = 1;
  for (int i = 0; i < 8; i++)
    for (int j = 0; j < MAX_N - n - 1; j++)
      for (int k = 0; k <= n; k++)
        dp[i+1][j+k] += dp[i][j];
  cout << dp[8][6*n] << endl;

  return 0;
}