#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1005;
int f[MAXN];
int a[4] = {1, 5, 10, 50};
int ans[13];
int main() {
  int n, m;
  scanf("%d", &m);
  memset(f, -1, sizeof(f));
  f[0] = 0;
  for (n = 1; n <= 12; ++n) {
    for (int i = MAXN - 1; i >= 1; --i)
      for (int j = 0; f[i] != n && j < 4; ++j)
        if (i - a[j] >= 0 && f[i - a[j]] == n - 1) f[i] = n, ++ans[n];
  }
  if (m <= 12)
    printf("%d\n", ans[m]);
  else
    printf("%lld\n", ans[12] + (m - 12) * 49LL);
  return 0;
}
