#include <bits/stdc++.h>
using namespace std;
vector<int> DP(int N, vector<int> C) {
  int V = C[C.size() - 1] * N + 1;
  vector<int> dp(V, 0), pre(V, 0);
  pre[0] = 1;
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < C.size(); j++) {
      for (int k = 0; k < V - C[j]; k++) dp[k + C[j]] += pre[k];
    }
    for (int j = 0; j < V; j++) {
      if (dp[j] >= 1)
        pre[j] = 1;
      else
        pre[j] = 0;
      dp[j] = 0;
    }
  }
  return pre;
}
long long n;
int main() {
  cin >> n;
  if (n <= 900) {
    vector<int> ret = DP(n, vector<int>{1, 5, 10, 50});
    int cnt = 0;
    for (int i = 0; i < ret.size(); i++) {
      if (ret[i] == 1) cnt++;
    }
    cout << cnt << endl;
  } else {
    vector<int> ret1 = DP(400, vector<int>{0, 4, 9, 49});
    vector<int> ret2 = DP(400, vector<int>{0, 40, 45, 49});
    long long cnt = n * 49LL + 1, cnt1 = 0, cnt2 = 0;
    for (int i = 0; i < 10000; i++) {
      if (ret1[i] == 0) cnt1++;
      if (ret2[i] == 0) cnt2++;
    }
    cout << cnt - cnt1 - cnt2 << endl;
  }
  return 0;
}
