#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)
const ll mod = 1e9+7;

int main(){
  int n;
  cin >> n;
  int cnti=0,cntj = 0;
  int res = 0;
  for (int i = 0; i <= 100;i+=5){
    for (int j = 0; j <= 100; j+=2){
      for (int k = 0; k <= 100;k+=3){
        //cout << cnti << " " << cntj << endl;
        if (i/5 < j/2) continue;
        if (i+j+k == n) res++;
        //cout << "i,j,k " << i << " " << j << " " << k << endl;
      }
    }
  }
  cout << res << endl;

  return 0;
}