local mfl = math.floor

local function comp(a, b)
  return a < b
end

local function lower_bound(ary, x)
  local num = #ary
  if num == 0 then return 1 end
  if not comp(ary[1], x) then return 1 end
  if comp(ary[num], x) then return num + 1 end
  local min, max = 1, num
  while 1 < max - min do
    local mid = mfl((min + max) / 2)
    if comp(ary[mid], x) then
      min = mid
    else
      max = mid
    end
  end
  return max
end

local n = 0LL + io.read("*n")
local t = {0}
local tn = n
if n == 0LL then
  print(1)
else
  while 0LL < tn do
    local sn = tn
    while 0LL < sn do
      table.insert(t, sn)
      sn = sn / 5LL
    end
    tn = tn / 3LL
  end
  table.sort(t)
  local ret = {1}
  for i = 2, #t do
    local b, c = lower_bound(t, t[i] / 3LL), lower_bound(t, t[i] / 5LL)
    ret[i] = ret[b] + ret[c]
  end
  print(ret[#t])
end