#include <bits/stdc++.h>
using namespace std;
long long N, C;
set<long long> S;
map<long long, vector<long long> > M;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> N;
  if (N >= 100) {
    cout << (long long)4653 + (N - 100) * 49 << '\n';
    return 0;
  }
  long long T = 0;
  for (int a = 0; a <= N; a++) {
    T = a;
    for (int b = 0; b <= N - T; b++) {
      T += b;
      for (int c = 0; c <= N - T; c++) {
        T += c;
        long long Z = a + b * 5 + c * 10 + (N - T) * 50;
        if (S.find(Z) != S.end()) {
        } else {
          S.insert(Z);
          vector<long long> V(4);
          V[0] = a, V[1] = b, V[2] = c, V[3] = N - T;
          M[Z] = V;
        }
        T -= c;
      }
      T -= b;
    }
  }
  cout << S.size() << '\n';
  return 0;
}
