#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const double EPS = 1e-9;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
int dp[5][4050];
int main() {
  int cnt = 0;
  for (int i = 0; i <= 4000; i++) {
    dp[1][i]++;
  }
  for (int i = 2; i <= 4; i++) {
    for (int j = 0; j <= 4000; j++) {
      for (int k = 0; k <= 4000; k++) {
        if (j - k >= 0) {
          dp[i][j] += dp[i - 1][j - k];
        }
      }
    }
  }
  int n;
  while (scanf("%d", &n) != EOF) {
    cout << dp[4][n] << endl;
  }
  return 0;
}
