#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;
 
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()
 
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

map<ll, ll> mp;

ll calc(ll x){
    if (x == 0) return 1;
    if (mp.count(x)) return mp[x];
    ll ret = calc(x / 3) + calc(x / 5);
    return mp[x] = ret;
}

int main() {
    ll n;
    cin >> n;

    cout << calc(n) << endl;
    
    return 0;
}