#include <bits/stdc++.h>
using namespace std;
int n;
set<int> q;
void rec(int pos = 0, int cur = 0) {
  if (pos == n) {
    q.insert(cur);
    return;
  }
  rec(pos + 1, cur + 1);
  rec(pos + 1, cur + 5);
  rec(pos + 1, cur + 10);
  rec(pos + 1, cur + 50);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  if (n <= 11) {
    rec();
    cout << (int)q.size();
  } else {
    long long x = 1LL * (n - 11) * 49;
    n = 11;
    rec();
    x += (int)q.size();
    cout << x;
  }
}
