#include <bits/stdc++.h>
using namespace std;
int num[4] = {1, 5, 10, 50};
set<int> s;
void dfs(int j, int val) {
  if (j == 0) {
    s.insert(val);
    return;
  }
  for (int i = 0; i < 4; ++i) {
    dfs(j - 1, val + num[i]);
  }
}
void calc(int n) {
  if (n < 20) {
    s.clear();
    for (int i = 0; i <= n; ++i) {
      for (int j = 0; j <= n - i; ++j) {
        for (int k = 0; k <= n - i - j; ++k) {
          int res = n - i - j - k;
          s.insert(i + 5 * j + 10 * k + 50 * res);
        }
      }
    }
    printf("%d\n", s.size());
  } else {
    printf("%lld\n", 1ll * n * 49 - 247);
  }
}
int main() {
  int n;
  if (fopen("1.in", "r") != nullptr) freopen("1.in", "r", stdin);
  while (~scanf("%d", &n)) {
    calc(n);
  }
  return 0;
}
