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]:
        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):
    count = 0

    def dfs(prod, last_p):
        nonlocal count
        count += 1
        remaining = N // prod
        if remaining == 0:
            return
        p = last_p + 1
        while True:
            if (p - 1) > remaining:
                break
            if is_prime(p):
                current_contribution = (p - 1)
                e = 1
                while current_contribution <= remaining:
                    new_prod = prod * current_contribution
                    if new_prod > N:
                        break
                    dfs(new_prod, p)
                    current_contribution *= p
                    e += 1
            p += 1

    dfs(1, 0)
    return count

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