n = int(input())
x = int(n**0.5)
s = set()

# Step 1: Collect quotients from K=1 to K=x
for k in range(1, x + 1):
    s.add(n // k)

# Step 2: Check for quotients from q'=1 to q'=x which can be generated by K > x
for q_prime in range(1, x + 1):
    l = (n // (q_prime + 1)) + 1
    r = n // q_prime
    if l > r:
        continue
    if r >= x + 1 and l <= n:
        s.add(q_prime)

print(len(s))