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)
# template getFactorByProcess(n:int):seq[int] =
#   import osproc
#   when defined(macosx):
#     const factor = "gfactor "
#   else :
#     const factor = "factor "
#   let p = execProcess(factor & $n ).strip().split()
#   p[1..p.len()-1].map(parseInt)

proc listupFactors(n:int) : seq[int] =
  result = @[]
  var i = 2
  var n2 = n
  while i <= n2.float.sqrt.int:
    if n2 mod i == 0:
      result &= i
      n2 = n2 div i
    else:
      i += 1
  result &= n2


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()
let factors = n.listupFactors()
var xs = initIntSet()
xs.incl 1
for f in factors:
  for x in toSeq(xs.items):
    xs.incl(x * f)

var results = initIntSet()
for x in xs:
  results.incl concat(x,n div x)
  results.incl concat(n div x,x)
echo results.card