local mfl, mce = math.floor, math.ceil
local function getpattern(n, patall, idx)
  local used = {}
  local retary = {}
  local div = patall
  for i = 1, n do used[i] = false end
  for i = n, 1, -1 do
    div = mfl(div / i)
    local v_idx = mfl(idx / div)
    idx = idx % div
    local tmp_idx = 0
    for j = 1, n do
      if not used[j] then
        if tmp_idx == v_idx then
          table.insert(retary, j)
          used[j] = true
          break
        else
          tmp_idx = tmp_idx + 1
        end
      end
    end
  end
  return retary
end
local k = io.read("*n")
local c = 0
local all = 1
for i = 1, 8 do
  all = all * i
end
for i = 0, all - 1 do
  local p = getpattern(8, all, i)
  local v, m = 0, 1
  for j = 1, 8 do
    v = v + m * p[j]
    m = m * 10
  end
  if v % k == 0 then c = c + 1 end
end
print(c)