#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
map<ll,ll> memo;
ll dfs(ll n){ 
  if (n == 0) return 1;
  if (!memo.count(n)) return memo[n] = dfs(n/3) + dfs(n/5);
  return memo[n];
}

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