#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 10;
int n, L[50], R[50];
int main() {
  for (int i = 0; i < 49; i++) L[i] = INF, R[i] = -INF;
  scanf("%d", &n);
  L[0] = 0;
  R[0] = n;
  for (int i = 0; i <= min(n, 9); i++) {
    for (int j = 0; j <= min(n, 49); j++) {
      if (i + j > n) continue;
      int sum = (i * 4 + j * 9);
      int r = sum % 49, b = sum / 49;
      L[r] = min(L[r], b);
      R[r] = max(R[r], b + n - i - j);
    }
  }
  long long ans = 0;
  for (int i = 0; i < 49; i++) {
    if (L[i] >= INF) continue;
    ans += R[i] - L[i] + 1;
  }
  cout << ans << endl;
  return 0;
}
