#include <bits/stdc++.h>
const int N = 1;
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
map<int, bool> M;
int m;
int ji(int i, int j, int k, int n) {
  return i + j * 5 + k * 10 + (n - i - j - k) * 50;
}
int work(int n) {
  int ans = 0;
  M.clear();
  for (int i = 0; i <= n; ++i)
    for (int j = 0; i + j <= n; ++j)
      for (int k = 0; i + j + k <= n; ++k)
        if (M[ji(i, j, k, n)] == 0) ans += 1, M[ji(i, j, k, n)] = 1;
  return ans;
}
int main() {
  m = read();
  if (m <= 12) {
    printf("%d\n", work(m));
    return 0;
  }
  printf("%I64d\n", 1LL * 49 * (m - 12) + 1LL * work(12));
  return 0;
}
