#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

ll a[1000000];

ll solve1(ll n){
  if(a[n]>0) return a[n];
  return a[n]=solve1(n/3)+solve1(n/5);
}

ll solve(ll n){
  if(n<1000000) return a[n];
  return solve(n/3)+solve(n/5);
}

int main()
{
	ll n; cin>>n;
  a[0]=1;
  if(n<1000000){
    cout<<solve1(n)<<endl;
    return 0;
  }
  for(ll i=1; i<1000000; i++){
    solve1(i);
  }
  cout<<solve(n)<<endl;
	return 0;
}