#include <bits/stdc++.h>
using namespace std;
class Solution {
  int n, m;
  static constexpr int BOUND = 10;
  vector<bool> polyMul(vector<bool> a, vector<bool> b) {
    vector<bool> sol(a.size() + b.size() - 1);
    for (int i = 0; i < a.size(); ++i)
      for (int j = 0; j < b.size(); ++j) {
        sol[i + j] = sol[i + j] | (a[i] & b[j]);
      }
    return sol;
  }

 public:
  void run(istream &in, ostream &out) {
    in >> n;
    int cnt;
    if (n > BOUND)
      cnt = 248;
    else {
      vector<bool> poly(50), ans = {true};
      poly[0] = poly[4] = poly[9] = poly[49] = 1;
      for (int v = n; v; v >>= 1, poly = polyMul(poly, poly)) {
        if (v & 1) ans = polyMul(ans, poly);
      }
      cnt = count(ans.begin(), ans.end(), false);
    }
    out << (long long)n * 49 + 1 - cnt << '\n';
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  Solution().run(cin, cout);
  return 0;
}
