/* -*- coding: utf-8 -*-
 *
 * 287.cc: No.287 場合の数 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int M = 8;
const int MAX_N = 100;
const int MAX_N6 = 6 * MAX_N;

/* typedef */

typedef long long ll;

/* global variables */

ll dp[M + 1][MAX_N6 + 1];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;
  int n6 = n * 6;

  dp[0][0] = 1;

  for (int i = 0; i < M; i++)
    for (int j = 0; j <= n6; j++) {
      int maxk = min(n6 - j, n);
      for (int k = 0; k <= maxk; k++)
	dp[i + 1][j + k] += dp[i][j];
    }

  printf("%lld\n", dp[M][n6]);
  return 0;
}