#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using vi = vector<long long>;
using mi = map<long long, long long>;
using pi = pair<long long, long long>;
const long long N = 100005;
const long long MOD = 1e9 + 7;
const long long inf = 1e18 + 1;
mi m;
long long n;
long long dp[15];
void fil(long long i, long long j, long long last) {
  if (j == n) m[i]++;
  if (j < n) {
    fil(i + 50, j + 1, 50);
    if (last == 50) return;
    fil(i + 10, j + 1, 10);
    if (last == 10) return;
    fil(i + 5, j + 1, 5);
    if (last == 5) return;
    fil(i + 1, j + 1, 1);
  }
  return;
}
int32_t main() {
  for (long long i = 1; i < 15; i++) {
    n = i;
    fil(0, 0, 0);
    dp[i] = m.size();
    m.clear();
  }
  cin >> n;
  if (n <= 12)
    cout << dp[n];
  else
    cout << dp[12] + 49 * (n - 12);
  return 0;
}
