#include<algorithm>
#include<iostream>
#include<map>
using namespace std;
typedef long long lint;
#define rep(i,n)for(int i=0;i<(int)(n);++i)

map<lint,lint>m;
lint f(lint n){
  if(m.count(n))return m[n];
  lint a=n==0?1:f(n/3)+f(n/5);
  return m[n]=a;
}

int main(){
  lint n;
  cin>>n;
  cout<<f(n)<<endl;
}