#include <bits/stdc++.h>
using namespace std;
bitset<100000> f[2];
int n, ans[100];
int main() {
  scanf("%d", &n);
  f[0][0] = 1;
  for (register int i = 1; i <= 14; ++i) {
    f[i & 1].reset();
    f[i & 1] |= f[i & 1 ^ 1] << 1;
    f[i & 1] |= f[i & 1 ^ 1] << 5;
    f[i & 1] |= f[i & 1 ^ 1] << 10;
    f[i & 1] |= f[i & 1 ^ 1] << 50;
    ans[i] = f[i & 1].count();
  }
  if (n > 14)
    printf("%I64d\n", 1LL * (n - 14) * 49 + ans[14]);
  else
    printf("%d\n", ans[n]);
  return 0;
}
