#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
const long long maxn = (long long)2e3 + 5;
const long long mod = 1000000007;
const long long inf = 0x3f3f3f3f;
long long dfs(long long x) {
  long long tmp = 0;
  unordered_map<long long, bool> mp;
  for (long long i = 0; i <= x; ++i)
    for (long long j = 0; i + j <= x; ++j)
      for (long long k = 0; i + j + k <= x; ++k) {
        long long t = x - i - j - k;
        t = i + 5 * j + 10 * k + 50 * t;
        if (!mp[t]) {
          mp[t] = true;
          ++tmp;
        }
      }
  return tmp;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  if (n <= 20)
    cout << dfs(n);
  else
    cout << dfs(20) + (n - 20) * 49;
  return 0;
}
