#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;


ll dp[9][801];

int main() {

  int n; cin >> n;

  dp[0][0] = 1;

  rep(i, 8) rep(x, i*100+1) rep(a, n+1) {
    if(dp[i][x]) dp[i+1][x+a] += dp[i][x];
  }

  cout << dp[8][6*n] << endl;

  return 0;
}