#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <cassert>
#pragma GCC optimize("O3")
#pragma comment(linker, "STACK:36777216")
using namespace std;
using i64 = int64_t;
constexpr i64 mod = 17;
using vi = vector<i64>;
using vvi = vector<vi>;
using ii = pair<i64, i64>;
using vii = vector<ii>;

map<i64, bool> required;
map<i64, i64> req_val;

void dfs(i64 n) {
    if (n == 0) return;
    if (required.count(n)) return;
    required[n] = 1;
    dfs(n / 3);
    dfs(n / 5);
}

int main() {
    i64 n;
    cin >> n;
    dfs(n);
    vi req;
    for (auto& p: required) {
        req.push_back(p.first);
    }
    sort(req.begin(), req.end());
    req_val[0] = 1;
    for (i64 i: req) {
        req_val[i] = req_val[i / 3] + req_val[i / 5];
    }
    cout << req_val[n] << endl;
}