#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

ll memo[7][601][101][101];
double X;

ll dfs(int i, int score, int mi, int ma) {
  if (memo[i][score][mi][ma] != -1) {
    return memo[i][score][mi][ma];
  }
  ll res = 0;

  if (i == 6) {
    int r = score - (mi + ma);
    if (100 * X == 25 * r) {
      // fprintf(stderr, "score: %d, mi: %d, ma: %d\n", score, mi, ma);
      res = 1LL;
    } else {
      res = 0LL;
    }
  } else {
    for (int s = 0; s <= 100; ++s) {
      res += dfs(i + 1, score + s, min(mi, s), max(ma, s));
    }
  }

  return memo[i][score][mi][ma] = res;
}

int main() {
  memset(memo, -1, sizeof(memo));
  cin >> X;

  cout << dfs(0, 0, 100, 0) << endl;

  return 0;
}