#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void gmax(T &a, T b) {
  a = a > b ? a : b;
}
template <typename T>
inline void gmin(T &a, T b) {
  a = a < b ? a : b;
}
int n;
set<int> st;
void work50(int n, int S) { st.insert(n * 50 + S); }
void work10(int n, int S) {
  for (int i = 0; i <= n; i++) work50(n - i, i * 10 + S);
}
void work5(int n, int S) {
  for (int i = 0; i <= n; i++) work10(n - i, i * 5 + S);
}
void work1(int n, int S) {
  for (int i = 0; i <= n; i++) work5(n - i, i + S);
}
int main() {
  cin >> n;
  if (n <= 11)
    work1(n, 0), printf("%d\n", st.size());
  else
    printf("%I64d\n", (long long)n * 49 - 247);
  return 0;
}
