#include <bits/stdc++.h>
template <class C, class E>
inline bool contains(const C& container, const E& element) {
  return container.find(element) != container.end();
}
template <class T>
inline void checkmin(T& a, T b) {
  if (b < a) a = b;
}
template <class T>
inline void checkmax(T& a, T b) {
  if (b > a) a = b;
}
using namespace std;
set<int> pos;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << std::setprecision(15);
  cout << std::fixed;
  long long n;
  cin >> n;
  long long res = 0;
  map<long long, long long> modFirst;
  for (int c4 = (0), _b = (8); c4 <= _b; c4++) {
    for (int c9 = (0), _b = (48); c9 <= _b; c9++) {
      long long sum49 = 4 * c4 + 9 * c9;
      long long mm = sum49 % 49;
      if (!contains(modFirst, mm))
        modFirst[mm] = sum49;
      else {
        modFirst[mm] = min(modFirst[mm], sum49);
      }
      pos.insert(sum49);
    }
  }
  for (int c4 = (0), _b = (8); c4 <= _b; c4++) {
    for (int c9 = (0), _b = (48); c9 <= _b; c9++) {
      if (c4 + c9 <= n) {
        long long sum49 = 4 * c4 + 9 * c9;
        long long mm = sum49 % 49;
        if (sum49 == modFirst[mm]) {
          res += (n + 1) - (c4 + c9);
        }
      }
    }
  }
  cout << res;
  return 0;
}
