#include <bits/stdc++.h>
using namespace std;
int main() {
  int dis[4900];
  memset(dis, -1, sizeof(dis));
  dis[0] = 0;
  queue<int> q;
  q.push(0);
  while (!q.empty()) {
    int first = q.front();
    q.pop();
    if (first + 4 < 4900 && dis[first + 4] == -1) {
      dis[first + 4] = dis[first] + 1;
      q.push(first + 4);
    }
    if (first + 9 < 4900 && dis[first + 9] == -1) {
      dis[first + 9] = dis[first] + 1;
      q.push(first + 9);
    }
    if (first + 49 < 4900 && dis[first + 49] == -1) {
      dis[first + 49] = dis[first] + 1;
      q.push(first + 49);
    }
  }
  int n;
  scanf("%d", &n);
  long long ans = 0;
  for (int i = 0; i < 4900; i++) {
    if (dis[i] != -1 && dis[i] <= n) {
      ans++;
    }
  }
  for (int i = 4851; i < 4900; i++) {
    if (dis[i] <= n) {
      ans += n - dis[i];
    }
  }
  printf("%lld\n", ans);
}
