# coding: utf-8
import array, bisect, collections, copy, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    N = II()
    return (N,)


def solve(N):
    n_sqrt = math.floor(math.sqrt(N))
    s_ans = set()
    for i in range(1, n_sqrt + 1):
        div, mod = divmod(N, i)
        if mod == 0:
            s_ans.add(int(str(i) + str(div)))
            s_ans.add(int(str(div) + str(i)))
    ans = len(s_ans)
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()