#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fll;
const long double pi = acos(-1);
const int MOD = 1e9 + 7;
int main() {
  int n;
  scanf("%d", &n);
  set<int> tem = {1, 5, 10, 50};
  vector<int> v = {1, 5, 10, 50};
  if (n == 1)
    printf("%d\n", (int)tem.size());
  else {
    int last = 0;
    for (int i = 2; i <= 60; i++) {
      set<int> vai;
      for (int x : tem)
        for (int y : v) vai.insert(x + y);
      last = vai.size();
      if (i == n) {
        printf("%d\n", (int)vai.size());
        return 0;
      }
      tem = vai;
    }
    cout << (((long long)n - 60) * 49 + last) << endl;
  }
}
