#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e6 + 5, mod = 998244353, bit = 60;
long long int solve(long long int n) {
  set<long long int> ms;
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j + i <= n; j++) {
      for (int k = 0; k + j + i <= n; k++) {
        int l = n - (k + j + i);
        ms.insert(i * 1 + j * 5 + k * 10 + l * 50);
      }
    }
  }
  return ms.size();
}
signed main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  long long int pro = 1, temp, t, i, j, l, r, n, m, mid, z, k, x, y, rem,
                carry = 0, ind, ans = 0, mx = -LONG_LONG_MAX,
                mn = LONG_LONG_MAX, cnt = 0, curr = 0, prev, next, sum = 0,
                flag = 1, i1 = -1, i2 = -1;
  cin >> n;
  temp = max(0ll, n - 11);
  n = min(11ll, n);
  ans = 49 * temp + solve(n);
  cout << ans << '\n';
  return 0;
}
