#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3f;
const long long mod = 998244353;
const double eps = 1e-8;
const int maxn = 3e5 + 10;
const int maxm = 200005;
int n;
int ans[20] = {1,   4,   10,  20,  35,  56,  83,  116, 155, 198,
               244, 292, 341, 390, 439, 488, 537, 586, 635, 684};
void solve() {
  scanf("%d", &n);
  long long nowans = 1;
  if (n <= 19)
    nowans = ans[n];
  else {
    nowans = (long long)ans[19] + (long long)(n - 19) * 49;
  }
  printf("%lld\n", nowans);
  return;
}
int main() {
  solve();
  return 0;
}
