#include <bits/stdc++.h>
using namespace std;
long long n;
set<long long> st;
vector<long long> vs;
long long ds[] = {1, 5, 10, 50};
void dfs(long long i, long long s) {
  if (i == n) {
    int sum = 0;
    for (long long i = (long long)(0); i < (long long)(n); i++) sum += vs[i];
    st.insert(sum);
    return;
  }
  for (long long j = (long long)(s); j < (long long)(4); j++) {
    vs.push_back(ds[j]);
    dfs(i + 1, j);
    vs.pop_back();
  }
}
int main() {
  cin >> n;
  long long res;
  if (n <= 11) {
    dfs(0, 0);
    res = st.size();
  } else {
    res = (n - 11) * 49 + 292;
  }
  cout << res << endl;
  return 0;
}
