def is_prime(n):
    if n <= 1:
        return False
    elif n <= 3:
        return True
    elif n % 2 == 0:
        return False
    d = n - 1
    s = 0
    while d % 2 == 0:
        d //= 2
        s += 1
    bases = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
    for a in bases:
        if a >= n:
            continue
        x = pow(a, d, n)
        if x == 1 or x == n - 1:
            continue
        for _ in range(s - 1):
            x = pow(x, 2, n)
            if x == n - 1:
                break
        else:
            return False
    return True

def solve(N):
    if N == 0:
        return 0
    total = 1  # x=1
    stack = [(1, 2)]
    
    while stack:
        current_product, min_prime = stack.pop()
        p = min_prime
        while True:
            # Find next prime >= p
            while True:
                if p < 2:
                    p = 2
                if p == 2:
                    break
                if p % 2 == 0:
                    p += 1
                if is_prime(p):
                    break
                p += 1
            # Check if (p-1) exceeds the remaining
            remaining = N // current_product
            if (p - 1) > remaining:
                break
            # Process exponents for p
            max_contribution = remaining
            contribution = p - 1
            exponent = 1
            while contribution <= max_contribution:
                total += 1
                stack.append((current_product * contribution, p + 1))
                contribution *= p
                exponent += 1
            # Move to next prime candidate
            p += 1
    
    return total

# Read input and output the result
N = int(input())
print(solve(N))