#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>


typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;





int main()
{

    int Q;
    Q = 1;
    //cin >> Q;

    while (Q--) {
       
        int n;
        cin >> n;
        int f[120] = {};
        f[0] = 1;
        vector<set<tuple<int,int,int>>>r(120);
        r[0].insert({ 0,0,0 });
        for (int i = 0; i < n; i++) {
            if (!r[i].size())continue;
            for (auto ite = r[i].begin(); ite != r[i].end(); ite++) {
                tuple<int, int, int>x = *ite;
                
                r[i + 5].insert({ get<0>(x) + 1,get<1>(x),get<2>(x) });
                r[i + 7].insert({ get<0>(x) + 1,get<1>(x)+1,get<2>(x) });
                r[i + 3].insert({ get<0>(x) + 1,get<1>(x),get<2>(x)+1 });

            }
        }
        cout << r[n].size();

        
        

    }
    return 0;
}