#include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
  cin >> n;
  long long sol = 0;
  map<long long, int> s;
  long long upper = min(n, 13LL);
  for (long long i = 0; i <= upper; i++) {
    for (long long v = 0; i + v <= upper; v++) {
      for (long long x = 0; i + v + x <= upper; x++) {
        long long l = n - i - v - x;
        if (s[i + 5 * v + 10 * x + 50 * l] == 0) {
          s[i + 5 * v + 10 * x + 50 * l] = 1;
          sol++;
        }
      }
    }
  }
  if (n <= 13) {
    cout << sol << "\n";
  } else {
    cout << sol + 49LL * (n - 13);
  }
  return 0;
}
