#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<int>())
#define mp make_pair
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int> COST;
#define repl(i,n) for(ll i=0;i<(n);++i)
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
using Graf=vector<vector<int>>;
#define MAX 1000000007

int main()
{
    int n;
    cin >> n;
    int t,g,p;
    t=5;g=2;p=3;
    int count=0;
    if(n>=5){
        for(int i=0;t*i<=n;++i){
            for(int j=0;t*i+p*j<=n;++j){
                for(int k=0;k<=i&&t*i+p*j+g*k<=n;++k){
                    if(t*i+p*j+g*k==n){
                        count++;
                    }
                }
            }
        }
    }
    cout << count << endl;


}