#include <bits/stdc++.h>
#pragma GCC optimize("-Ofast", "-funroll-all-loops")
using namespace std;
int n, a[] = {0, 4, 10, 20, 35, 56, 83, 116, 155, 198, 244, 292, 341, 390, 439};
signed main() {
  cin >> n;
  if (n <= 11)
    cout << a[n];
  else
    cout << 292LL + 49LL * (n - 11);
  return 0;
}
