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
    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 main():
    global N
    N = int(sys.stdin.readline())
    if N < 1:
        print(0)
        return

    def dfs(current_phi, min_p):
        count = 0
        p = min_p + 1
        while True:
            if (p - 1) > (N // current_phi):
                break
            if not is_prime(p):
                p += 1
                continue
            term_phi = p - 1
            exponent = 1
            while True:
                new_phi = current_phi * term_phi
                if new_phi > N:
                    break
                count += 1
                count += dfs(new_phi, p)
                term_phi *= p
                exponent += 1
            p += 1
        return count

    total = 1 + dfs(1, 0)
    print(total)

if __name__ == "__main__":
    main()