/* -*- coding: utf-8 -*-
 *
 * 398.cc: No.398 ハーフパイプ(2) - 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 N = 6;

/* typedef */

typedef long long ll;

/* global variables */

ll fracs[N + 1];

/* subroutines */

ll perm(int as[]) {
  ll p = fracs[N];
  int pa = as[0], pk = 1;
  for (int i = 1; i < N; i++) {
    if (pa != as[i]) {
      if (pk > 1) p /= fracs[pk];
      pa = as[i], pk = 1;
    }
    else
      pk++;
  }
  if (pk > 1) p /= fracs[pk];
  return p;
}

/* main */

int main() {
  fracs[0] = 1;
  for (int i = 1; i <= N; i++) fracs[i] = fracs[i - 1] * i;

  double x;
  cin >> x;
  int y = (int)(x * 4);
  //printf("y=%d\n", y);

  ll cnt = 0;
  int as[N];
  
  for (as[1] = 0; as[1] <= 100; as[1]++) {
    for (as[2] = as[1]; as[2] <= 100; as[2]++) {
      for (as[3] = as[2]; as[3] <= 100; as[3]++) {
	as[4] = y - (as[1] + as[2] + as[3]);
	if (as[4] < as[3]) break;
	if (as[4] > 100) continue;

	if (as[1] > 0 && as[4] < 100)
	  as[0] = 0, as[5] = 100, cnt += perm(as) * as[1] * (100 - as[4]);
	if (as[1] > 0)
	  as[0] = 0, as[5] = as[4], cnt += perm(as) * as[1];
	if (as[4] < 100)
	  as[0] = as[1], as[5] = 100, cnt += perm(as) * (100 - as[4]);
	as[0] = as[1], as[5] = as[4], cnt += perm(as);
      }
    }
  }

  printf("%lld\n", cnt);
  return 0;
}