import sys

sys.setrecursionlimit(1 << 25)

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, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]:
        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):
    def count(current_product, last_prime):
        total = 0
        p = last_prime + 1
        while True:
            remaining_phi = N // current_product
            if (p - 1) > remaining_phi:
                break
            if not is_prime(p):
                p += 1
                continue
            contribution = p - 1
            new_prod = current_product * contribution
            if new_prod > N:
                p += 1
                continue
            total += 1
            total += count(new_prod, p)
            current_contribution = contribution
            while True:
                current_contribution *= p
                new_prod_higher = current_product * current_contribution
                if new_prod_higher > N:
                    break
                total += 1
                total += count(new_prod_higher, p)
            p += 1
        return total

    return 1 + count(1, 1)

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