#include <bits/stdc++.h>
using namespace std;
int memo[5][4011];
int solve(int p, int n) {
  if (!p && !n) return 1;
  if (!p || n <= 0) return 0;
  if (memo[p][n] > 0) return memo[p][n];
  int res = 0;
  for (int i = 0; i <= n; i++) res += solve(p - 1, n - i);
  return memo[p][n] = res;
}
int main() {
  int n;
  while (cin >> n) cout << solve(4, n + 1) << endl;
}
