import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum N = 6;
enum L = 100;

void main() {
  auto dp = new long[][][](L + 1, L + 1, N * L + 1);
  foreach (k; 0 .. L + 1) {
    dp[k][k][k] = 1;
  }
  foreach (i; 1 .. N) {
    auto dpNext = new long[][][](L + 1, L + 1, N * L + 1);
    foreach (x; 0 .. L + 1) foreach (y; x .. L + 1) foreach (z; 0 .. N * L + 1) {
      if (dp[x][y][z] != 0) {
        // foreach (k; 0 .. L + 1) {
          // dpNext[min(x, k)][max(y, k)][z + k] += dp[x][y][z];
        // }
        foreach (k; 0 .. x) {
          dpNext[k][y][z + k] += dp[x][y][z];
        }
        foreach (k; x .. y + 1) {
          dpNext[x][y][z + k] += dp[x][y][z];
        }
        foreach (k; y + 1 .. L + 1) {
          dpNext[x][k][z + k] += dp[x][y][z];
        }
      }
    }
    dp = dpNext;
  }
  
  try {
    for (; ; ) {
      const X = readReal();
      long ans;
      foreach (x; 0 .. L + 1) foreach (y; 0 .. L + 1) foreach (z; 0 .. N * L + 1) {
        if ((z - x - y) / 4.0 == X) {
          ans += dp[x][y][z];
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}