#include <iostream>
#include <algorithm>
using namespace std;

long dp[100000];

long sequence_function(long now){
    if(now < 100000){
        if(dp[now] != -1){
            return dp[now];
        }else if(now){
            return dp[now] = sequence_function(now / 3) + sequence_function(now / 5);
        }else{
            return dp[now] = 1;
        }
    }else{
        return sequence_function(now / 3) + sequence_function(now / 5);
    }
}

int main(){
    long N;
    cin >> N;
    fill(dp, dp + 100000, -1);
    cout << sequence_function(N) << endl;
}