#include <bits/stdc++.h>
using namespace std;
set<int> outp;
int n;
void rec(int pos, int value) {
  if (pos == n) {
    outp.insert(value);
    return;
  }
  rec(pos + 1, value + 1);
  rec(pos + 1, value + 5);
  rec(pos + 1, value + 10);
  rec(pos + 1, value + 50);
}
int need[49];
int main() {
  cin >> n;
  for (int i = 0; i < 49; i++) need[i] = 100;
  for (int b = 0; b < 49; b++)
    for (int c = 0; c < 9; c++) {
      need[(9 * b + 4 * c) % 49] = min(b + c, need[(9 * b + 4 * c) % 49]);
    }
  long long ans = 0;
  for (int i = 0; i < 49; i++) ans = ans + max(0, n - need[i] + 1);
  cout << ans << endl;
  return 0;
}
