#include <bits/stdc++.h>
using namespace std;
int n;
void work(int n) {
  map<int, int> v;
  int ans = 0;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= n; j++) {
      for (int k = 0; k <= n; k++) {
        for (int x = 0; x <= n; x++) {
          if (i + j + k + x == n) {
            int tot = i + j * 5 + k * 10 + x * 50;
            if (v[tot]) continue;
            v[tot] = 1;
            ans++;
          }
        }
      }
    }
  }
  cout << ans << "\n";
}
int main() {
  scanf("%d", &n);
  if (n <= 20)
    work(n);
  else
    cout << 1LL * 733 + 1LL * 49 * (n - 20);
  return 0;
}
