#include <iostream>
#include <map>
using namespace std;
using ll = long long;
map<ll, ll> dp;

ll dfs(ll i) {
  if (i == 0)
    return 1;
  if (dp.count(i) > 0)
    return dp[i];
  return dp[i] = dfs(i/3) + dfs(i/5);
}

int main() {
  ll N; cin >> N;

  cout << dfs(N) << endl;
  return 0;
}