import sequtils,strutils,algorithm,math,sugar,macros,strformat
import sets,tables,intsets,queues,heapqueue,bitops
template get*():string = stdin.readLine().strip()
macro unpack*(arr: auto,cnt: static[int]): auto =
  let t = genSym(); result = quote do:(let `t` = `arr`;())
  for i in 0..<cnt: result[1].add(quote do:`t`[`i`])
template times*(n:int,body) = (for _ in 0..<n: body)
template `max=`*(x,y) = x = max(x,y)
template `min=`*(x,y) = x = min(x,y)

proc concat(a,b:int):int =
  var dec = 1
  while true:
    if b >= dec * 10:
      dec *= 10
      continue
    return a * dec * 10 + b

let n = get().parseInt()
var results =  initIntSet()
for i in 1..n.float.sqrt.int:
  if n mod i != 0: continue
  results.incl(i.concat(cast[int](n div i)))
  results.incl(cast[int](n div i).concat(i))
echo results.card