import sys

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
    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):
    count = 1  # x=1

    def backtrack(current_phi, last_p, remaining):
        nonlocal count
        p = last_p + 1
        while p <= remaining + 1:
            if (p - 1) > remaining:
                break
            if is_prime(p):
                max_k = 0
                contribution = (p - 1)
                total_contribution = contribution
                while True:
                    new_phi = current_phi * total_contribution
                    if new_phi > N:
                        break
                    count += 1
                    new_remaining = N // new_phi
                    if new_remaining > 0:
                        backtrack(new_phi, p, new_remaining)
                    max_k += 1
                    total_contribution *= p
                    if total_contribution > remaining:
                        break
            p += 1

    backtrack(1, 0, N)
    return count

print(solve(int(sys.stdin.readline())))