#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int inf = 1e9;
const long long llf = 1e18;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int n;
set<int> q;
int a[] = {1, 5, 10, 50};
void dfs(int n) {
  for (int i = 0; i <= n; i++) {
    for (int j = 0; i + j <= n; j++) {
      for (int k = 0; i + j + k <= n; k++) {
        int l = n - i - j - k;
        q.insert(i + j * 5 + k * 10 + l * 50);
      }
    }
  }
}
int main() {
  cin >> n;
  if (n <= 20) {
    dfs(n);
    cout << q.size() << endl;
  } else {
    dfs(21);
    long long t = q.size();
    long long ans = t + (n - 21) * 1ll * 49;
    cout << ans << endl;
  }
  return 0;
}
