#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;

typedef long long i64;

i64 n;

unordered_map<i64,i64> um;

i64 rec(i64 i)
{
	if(i == 0) return 1;
	if(um.find(i) != um.end()) return um[i];
	um.emplace(i,rec(i / 3) + rec(i / 5));
	return um[i];
}

int main()
{
	cin >> n;
	cout << rec(n) << endl;
	return 0;
}