#include <bits/stdc++.h>
inline char fgc() {
  static char buf[100000], *p1 = buf, *p2 = buf;
  return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
             ? EOF
             : *p1++;
}
inline long long readint() {
  register long long res = 0, neg = 1;
  register char c = fgc();
  for (; !isdigit(c); c = fgc())
    if (c == '-') neg = -1;
  for (; isdigit(c); c = fgc()) res = (res << 1) + (res << 3) + c - '0';
  return res * neg;
}
const int ans[] = {0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292, 341},
          lim = 12;
int n;
int main() {
  n = readint();
  if (n <= lim) {
    printf("%d", ans[n]);
  } else {
    printf("%lld", ans[12] + (n - 12) * 49ll);
  }
  return 0;
}
