#include <bits/stdc++.h>
using namespace std;
long long ans, n;
map<long long, long long> a;
long long dfs(long long x) {
  a.clear();
  long long sum = 0;
  for (long long i = 0; i <= x; i++)
    for (long long j = 0; i + j <= x; j++)
      for (long long k = 0; i + j + k <= x; k++) {
        long long t = i + j * 5 + k * 10 + (x - i - j - k) * 50;
        if (!a[t]) a[t] = 1, sum++;
      }
  return sum;
}
signed main() {
  scanf("%lld", &n);
  if (n <= 20)
    ans = dfs(n);
  else
    ans = dfs(20) + (n - 20) * 49;
  printf("%lld\n", ans);
}
