#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n) - 1; (i) >= 0; --i)
#define SZ(n) (int)(n).size()
#define ALL(n) (n).begin(), (n).end()
#define MOD LL(1e9 + 7)
#define INF 1000000
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PI;

map<LL, LL> mp;

LL dfs(LL x) {
	if (!mp.count(x)) {
		return mp[x] = dfs(x / 3) + dfs(x / 5);
	}
	else {
		return mp[x];
	}
}

int main() {
	LL n;
	cin >> n;
	vector<LL> a;
	mp[0] = 1;
	cout << dfs(n) << endl;
	return 0;
}