#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i,n,m) for(int i = (int)(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = MOD - 1;
const ll LLINF = 4e18;

ll solve(ll n, map<ll, ll> &m) {
    if (n == 0) {
        return 1;
    }
    if (m.find(n) != m.end()) {
        return m[n];
    }
    else {
        return m[n] = solve(n / 3, m) + solve(n / 5, m);
    }
}

int main() {
    ll n; cin >> n;
    map<ll, ll> mp;
    cout << solve(n, mp) << endl;
    getchar(); getchar();
}