#include <bits/stdc++.h>
using namespace std;
int n;
set<int> P[10000];
signed main() {
  P[0].insert(0);
  for (int i = 0; i < 40; i++) {
    for (auto p : P[i]) {
      P[i + 1].insert(p + 1);
      P[i + 1].insert(p + 5);
      P[i + 1].insert(p + 10);
      P[i + 1].insert(p + 50);
    }
  }
  cin >> n;
  if (n < 30) {
    cout << P[n].size() << endl;
  } else {
    printf("%lld\n",
           (long long)(P[30].size() - P[29].size()) * (n - 29) + P[29].size());
  }
}
