#include <bits/stdc++.h>
using namespace std;
set<int> st;
const int N = 1e7 + 7;
map<pair<int, int>, bool> vis;
long long n;
void solve(int i, int sum) {
  if (i == n) {
    st.insert(sum);
    return;
  }
  if (vis[{i, sum}]) return;
  vis[{i, sum}] = 1;
  solve(i + 1, sum + 1);
  solve(i + 1, sum + 5);
  solve(i + 1, sum + 10);
  solve(i + 1, sum + 50);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  st.clear();
  vis.clear();
  if (n <= 12) {
    solve(0, 0);
    cout << st.size() << endl;
  } else
    cout << (long long)292 + (n - 11) * 49 << endl;
  return 0;
}
