import sys
import math

def is_prime(n):
    if n < 2:
        return False
    for p in [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]:
        if n % p == 0:
            return n == p
    d = n - 1
    s = 0
    while d % 2 == 0:
        d //= 2
        s += 1
    for a in [2, 325, 9375, 28178, 450775, 9780504, 1795265022]:
        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 count_x(current_product, min_p, N):
    total = 0
    p = min_p
    while True:
        if p > 2 * (10**6):
            break
        if is_prime(p):
            contribution_e1 = p - 1
            if current_product > N // contribution_e1:
                break
            max_contribution = N // current_product
            current_contribution = contribution_e1
            e = 1
            while current_contribution <= max_contribution:
                new_product = current_product * current_contribution
                if new_product > N:
                    break
                total += 1
                total += count_x(new_product, p + 1, N)
                e += 1
                next_contribution = current_contribution * p
                if next_contribution > max_contribution:
                    break
                current_contribution = next_contribution
        p += 1
        if p > 2 * (10**6):
            break
    return total

def main():
    N = int(sys.stdin.readline())
    if N == 0:
        print(0)
        return
    result = 1 + count_x(1, 2, N)
    print(result)

if __name__ == "__main__":
    main()