#include <bits/stdc++.h>
using namespace std;
inline int Int() {
  int x;
  scanf("%d", &x);
  return x;
}
inline long Long() {
  long x;
  scanf("%ld", &x);
  return x;
}
inline long long LLong() {
  long long x;
  scanf("%lld", &x);
  return x;
}
inline float Float() {
  float x;
  scanf("%f", &x);
  return x;
}
inline double Double() {
  double x;
  scanf("%lf", &x);
  return x;
}
inline pair<int, int> Pair() {
  pair<int, int> p;
  scanf("d %d", &p.first, &p.second);
  return p;
}
void S(char *x) { scanf("%s", x); }
void pI(int x) { printf("%d", x); }
void pL(long x) { printf("%ld", x); }
void pLL(long long x) { printf("%lld", x); }
void pUL(unsigned long long x) { printf("%llu", x); }
void pF(float x) { printf("%f", x); }
void pD(double x) { printf("%f", x); }
void pS(char x[]) { printf("%s", x); }
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
const double PI = acos(-1.0);
const double EPS = 1e-6;
const int MOD = (int)1e9 + 7;
const int maxn = (int)1e5 + 5;
const int LOGN = 20;
int v[] = {1, 5, 10, 50};
int main() {
  int n;
  cin >> n;
  long long ans = 0;
  set<int> s;
  if (n > 11) ans = (n - 11) * 1LL * 49, n = 11;
  for (int i = 0; i <= n; i++)
    for (int v = 0; i + v <= n; v++)
      for (int x = 0; i + v + x <= n; x++) {
        int l = n - i - v - x;
        int t = i + v * 5 + x * 10 + l * 50;
        s.insert(t);
      }
  ans += s.size();
  cout << ans;
  return 0;
}
