#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
const int INF = 0x3f3f3f3f;
map<long long, int> mp;
long long dfs(int n) {
  mp.clear();
  long long sum = 0;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; i + j <= n; j++) {
      for (int k = 0; i + k + j <= n; k++) {
        int l = n - i - k - j;
        long long tmp = i + j * 5 + k * 10 + l * 50;
        if (mp.count(tmp) == 0) {
          mp[tmp] = 1;
          sum++;
        }
      }
    }
  }
  return sum;
}
int main() {
  long long t;
  scanf("%lld", &t);
  if (t <= 20)
    printf("%lld\n", dfs(t));
  else
    printf("%lld\n", dfs(20) + 49 * (t - 20));
  return 0;
}
