from math import sqrt

def g(n):
    if n == 1:
        yield 1
    else:
        t = round(sqrt(n)) + 1
        for i in range(1, t):
            q, r = divmod(n, i)
            if r == 0:
                yield 2 if q != i else 1

n = int(input())
print(sum(g(n)))