from collections import defaultdict
import math


def prime_factorization(num: int) -> defaultdict:
    d = defaultdict(int)
    for n in range(2, math.ceil(math.sqrt(num)) + 2):
        while not (num % n):
            num //= n
            d[n] += 1
    if num > 1:
        d[num] += 1
    return d

# N % m == 0のとき，m分割できないので，
# N % m != 0を満たすmの個数っぽくね？
N = int(input())
f = prime_factorization(N)
yakusu = 1
for k, v in f.items():
    yakusu *= v + 1
print(N - yakusu)