#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9+7;
map<ll,ll> mp;
ll dfs(ll num){
    if(num == 0)return 1;
    if(mp[num] != 0)return mp[num];
    return mp[num] = dfs(num/3) + dfs(num/5);
}
main(){
    ll N;
    cin >> N;
    mp[0] = 1;
    dfs(N);
    cout << mp[N] << endl;
}