#include <bits/stdc++.h>
using namespace std;
int const N = 3e5 + 5;
int n, x, y;
long long fact[N];
long long dp[N];
long long calc(int n) {
  if (dp[n] != 0) return dp[N];
  vector<int> a;
  for (int x = 0; x <= n; x++)
    for (int y = 0; y <= n - x; y++)
      for (int z = 0; z <= n - x - y; z++) {
        int t = n - x - y - z;
        a.push_back(x + y * 5 + z * 10 + t * 50);
      }
  sort(a.begin(), a.end());
  return unique(a.begin(), a.end()) - a.begin();
}
long long C(int x, int y) { return fact[y] / (fact[x] * fact[y - x]); }
long long calc2(int n) {
  if (n <= 11) return calc(n);
  return calc(11) + (long long)(n - 11) * 49;
}
int main() {
  cin >> n;
  cout << calc2(n) << endl;
}
