#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;

int m = 1 << 20;
vector<int> p(m);

int64_t dfs(int64_t i) {
    if (i < m) return p[i];
    return dfs(i / 3) + dfs(i / 5);
}

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

    p[0] = 1;
    for (int i = 1; i < m; i++) {
        p[i] = p[i / 3] + p[i / 5];
    }

    cout << dfs(n) << endl;

    return 0;
}