#include <bits/stdc++.h>
using namespace std;
const int INF = 0x60000000;
const int MINF = -1000000000;
const int mod = 1000000007;
const int cons = 100001;
const double pi = 3.141592653589793;
const int sqrtMax = 317;
const int blocks = cons / 3;
const int MOD = 100000;
long long dp[1000001];
int ans[5001];
int main() {
  int m;
  scanf("%d", &m);
  for (int n = 1; n <= 50; n++) {
    int cnt = 0;
    int sum = 0;
    memset(dp, 0, sizeof(dp));
    for (int i = 0; i <= n; i++) {
      for (int j = 0; j <= n; j++) {
        for (int k = 0; k <= n; k++) {
          for (int p = 0; p <= n; p++) {
            if (i + j + k + p == n) {
              sum = i * 1 + j * 5 + k * 10 + p * 50;
              dp[sum]++;
              if (dp[sum] > 1) {
              } else if (dp[sum] == 1)
                cnt++;
            }
          }
        }
      }
    }
    ans[n] = cnt;
  }
  if (m > 50) {
    printf("%lld\n", (long long)ans[50] + 49LL * (m - 50));
  } else {
    printf("%d\n", ans[m]);
  }
  return 0;
}
