n = int(eval(input()))

c = []

for i in range(1,n+1):

    k = []

    for j in range(1,i+1):

        if i % j == 0:

            k.append(j)



    if len(k) == 8:

        if i % 2 != 0:

            c.append(i)

print((len(c)))
def make_divisors(n):

    divisors = []

    for i in range(1, int(n**0.5)+1):

        if n % i == 0:

            divisors.append(i)

            if i != n // i:

                divisors.append(n//i)

    return len(divisors)

n = int(eval(input()))

ans = 0

for i in range(1,n+1,2):

    if make_divisors(i) == 8:

        ans += 1

print(ans)
n = int(eval(input()))
c = []
for i in range(1, n + 1):
    k = []
    for j in range(1, i + 1):
        if i % j == 0:
            k.append(j)
    if len(k) == 8:
        if i % 2 != 0:
            c.append(i)
print((len(c)))

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5) + 1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n // i)
    return len(divisors)


n = int(eval(input()))
ans = 0
for i in range(1, n + 1, 2):
    if make_divisors(i) == 8:
        ans += 1
print(ans)

+def make_divisors(n): +    divisors = [] +    for i in range(1, int(n**0.5) + 1): +        if n % i == 0: +            divisors.append(i) +            if i != n // i: +                divisors.append(n // i) +    return len(divisors) + + -c = [] -for i in range(1, n + 1): -    k = [] -    for j in range(1, i + 1): -        if i % j == 0: -            k.append(j) -    if len(k) == 8: -        if i % 2 != 0: -            c.append(i) -print((len(c))) +ans = 0 +for i in range(1, n + 1, 2): +    if make_divisors(i) == 8: +        ans += 1 +print(ans)