#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n) { return (n % 1000000007); }
long long gcd(long long a, long long b) {
  if (a == 0 || b == 0) return 0;
  if (b == 1)
    return b;
  else
    return gcd(b, a % b);
}
string cur;
set<tuple<long long, long long> > s;
long long ans = 0;
void solve(long long i, long long sum, long long n) {
  if (s.count(make_tuple(i, sum))) return;
  s.insert(make_tuple(i, sum));
  if (i == n) {
    ans++;
    return;
  }
  solve(i + 1, sum + 1, n);
  solve(i + 1, sum + 5, n);
  solve(i + 1, sum + 10, n);
  solve(i + 1, sum + 50, n);
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long lst = 0;
  long long pre[14];
  for (long long i = 1; i <= 13; i++) {
    s.clear();
    ans = 0;
    solve(0, 0, i);
    pre[i] = ans;
  }
  long long n;
  cin >> n;
  if (n <= 13)
    cout << pre[n] << '\n';
  else {
    long long resp = pre[13] + (n - 13) * 49LL;
    cout << resp << '\n';
  }
}
