#include <bits/stdc++.h>
using namespace std;
const int maxn = 2000;
const int inf = 0x7fffffff;
template <class T>
inline void read(T &x) {
  x = 0;
  int ne = 0;
  char c;
  while (!isdigit(c = getchar())) ne = c == '-';
  x = c - 48;
  while (isdigit(c = getchar())) x = (x << 3) + (x << 1) + c - 48;
  x = ne ? -x : x;
  return;
}
int f[13] = {0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292, 341};
bool vis[10000005];
int ans = 0, n;
void dfs(int now, int cnt) {
  if (now == n + 1) {
    if (!vis[cnt]) {
      vis[cnt] = 1;
      ans++;
    }
    return;
  }
  for (register int i = 1; i <= 4; i++) {
    dfs(now + 1, cnt + f[i]);
  }
  return;
}
int main() {
  read(n);
  if (n <= 12)
    printf("%d\n", f[n]);
  else
    printf("%I64d\n", (long long)f[12] + (long long)(n - 12) * 49);
  return 0;
}
