#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const long long mod = 1e9 + 7;
long long f[maxn] = {0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292};
int val[5] = {1, 5, 10, 50};
set<int> st;
long long n, sum = 0;
void dfs(int x) {
  if (x == n + 1) {
    st.insert(sum);
    return;
  }
  for (int i = 0; i < 4; i++) {
    sum += val[i];
    dfs(x + 1);
    sum -= val[i];
  }
}
int main() {
  int T = 1, cas = 1;
  while (T--) {
    scanf("%lld", &n);
    long long ans = 292 + (n - 11) * 49;
    if (n <= 11)
      printf("%lld\n", f[n]);
    else
      printf("%lld\n", ans);
  }
  return 0;
}
