#include <bits/stdc++.h>
using namespace std;
set<int> v;
int n;
int a[] = {1, 5, 10, 50};
vector<int64_t> ans;
int64_t A;
void dfs(int i, int j, int sum) {
  if (i == n - 1) {
    for (int k = j; k < 4; ++k) {
      if (!v.insert(sum + a[k]).second)
        ;
    }
    return;
  }
  for (int k = j; k < 4; ++k) dfs(i + 1, k, sum + a[k]);
}
void bf() {
  for (n = 1; n <= 20; ++n) {
    v.clear();
    dfs(0, 0, 0);
    ans.push_back(v.size());
  }
}
int main() {
  bf();
  int n;
  scanf("%d", &n);
  --n;
  if (n > 18) {
    A = (n - 18) * 49ll;
    n = 18;
  }
  cout << A + ans[n];
}
