#include <bits/stdc++.h>
using namespace std;
const int MX = 1e5 + 5;
const int mod = 998244353;
long long n;
long long cal(int x) {
  map<int, int> m;
  long long res = 0;
  for (int i = 0; i <= x; i++) {
    for (int j = 0; j + i <= x; j++) {
      for (int k = 0; k + i + j <= x; k++) {
        long long z = i + j * 5 + k * 10 + (x - i - j - k) * 50;
        if (!m[z]) {
          res++;
          m[z] = 1;
        }
      }
    }
  }
  return res;
}
int main() {
  cin >> n;
  if (n <= 20)
    cout << cal(n) << endl;
  else
    cout << cal(20) + (n - 20) * 49 << endl;
  return 0;
}
