peterverebics/CodeNet_Python_118 huggingface dataset:
n = int(input())

for i in range(1, n+1, 2):
    count = 0
    for j in range(1, n+1):
        if (i % j) == 0:
            count += 1
    if count == 8:
        print(i)
n = int(input())
ans = 0
for j in range(1,n+1,2):
    sm = sum(n % i == 0 for i in range(1,j+1))
    if sm == 8:
        ans += 1
print(ans)
N=int(input())
ans=0
a=0
for i in range(1,N+1,2):
    for j in range(1,i+1):
        if i%j==0:
            a+=1
            if a==8:
                ans+=1

print(ans)
N = int(input())
if N < 105:
    print(0)
elif N < 135:
    print(1)
elif N < 165:
    print(2)
elif N < 189:
    print(3)
else:
    print(4)
from math import sqrt
N = int(input())
ans = 0
for i in range(7, N+1):
  if i%2==0:
    continue
  c = 0
  for j in range(1, int(sqrt(i))+1):
    if i%j==0:
      if i%j==j:
        c+=1
      else:
        c+=2
  if c==8:
    ans += 1
    print(i)
print(ans)
c = 0
n = int(input())
if n%2==1:
    for i in range(1,n+1):
        n%i == 0
        c += 1
        if c == 8:
            print('1')
    else:
        print('0')
n=int(input())
count=0
for i in range(1,n+1):
    if n%1==0:
        count+=1
if count==8:
    print("1")
else:
    print("0")
N = int(input())
if N < 105:
  print(0)
elif 105 <= N < 135:
  print(1)
elif 135 <= N < 165:
  print(2)
elif 165 <= N < 189:
  print(3)
else:
  print(4)
def cnt_prime(x):
    cnt = 0
    for i in range(1, int(x ** 0.5 // 1) + 1):
        if x % i == 0:
            cnt += 1
    
    return cnt


N = int(input())
ans = 0

for i in range(1, N+1):
    if i % 2 == 1:
        c = cnt_prime(i)
        if c == 8:
            ans += 1

print(ans)
n=int(input())
ans=0
for i in range(1,n,2):
  cnt=0
  for j in range(1,i+1):
    if i%j==0:
      cnt+=1
  if cnt==8:
    ans+=1
print(ans)
def make_divisors(n: int) -> list:
    return_list = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            return_list.append(i)
            if i != n // i:
                return_list.append(n//i)

    return return_list
N = int(input())
cnt = 0
for i in range(1,N+1,2):
    if len(make_divisors(i)) == 8:
        cnt += 1
        print(i)
print(cnt)
N = int(input())
if N < 105:
    print(0)
else:
    ans = 1
    for a in range(106, N+1):
        tmp = 1
        for b in range(2, a//2):
            if a % b == 0:
                tmp += 1
        if tmp == 8:
            ans += 1
    print(ans)
n = int(input())
cnt, ans = 0, 0
if n == 105:
    print(1)
elif n <= 104:
    print(0)
else:
    for x in range(107,n+1,2):
        for y in range(1,x+1):
            if x % y == 0:
                cnt += 1
        if cnt >= 8 and x % 2 != 0:
            ans += 1
    print(ans+1)
def solve():
    ans = 0
    n=int(input())
    for i in range(1,n+1):
        div_list = []
        for j in range(i,int(i**0.5)+1):
            if i%j!=0:
                continue
            if i//j==j:
                div_list.append(j)
            else:
                div_list.append(i//j)
                div_list.append(j)
    print(ans)

if __name__ == '__main__':
    solve()
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)

    divisors.sort()
    return divisors

N = int(input())
ans = 0
for i in range(1, N + 1):
    if i % 2 == 0:
        if len(make_divisors(i)) == 8:
            ans += 1
print(ans)
def count_dividers(n):
    sqrt = int(n ** 0.5)
    count = 0
    for i in range(1, sqrt):
        if n % i == 0:
            count += 1
    count *= 2
    if n == sqrt ** 2:
        count += 1

    return count


N = int(input())

print(len([0 for n in range(105, N + 1, 2) if count_dividers(n) == 8]))
n=int(input())
if n<105:
	print(0)
elif 105<=n<135:
	print(1)
elif 135<=n<189:
	print(2)
elif 189<=n:
	print(3)
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(input())
a = [105,135,165,189,195]

if a[0] > n: print(0)
elif a[0] <= n < a[1]: print(1)
elif a[1] <= n < a[2]: print(2)
elif a[2] <= n < a[3]: print(3)
elif a[3] <= n < a[4]: print(4)
elif a[4] >= n: print(5)
n=int(input())
import math
cnt=0
coun=0
x=math.floor(n**(1/2))
if n<105:
  print(0)
  exit()
else :
  for i in range (105,n+1):
    for j in range (1,x):
      if i%j==0 and j!=i/j:
        cnt+=2
    if cnt==8:
      coun+=1
print(coun)
ans=0
n=int(input())
if n<105:
  print('0')
else:
  for i in range(105,n+1):
    if i%2!=0:
      cnt=0
      for j in range(1,i+1):
        if i%j==0:
          cnt+=1
      if cnt==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)

    divisors.sort()
    return divisors
n=int(input())
if n<105:
    print(0)
    exit()
ans=1
for i in range(106,n+1):
    l=make_divisors(i)
    if len(l)==8:
        ans+=1
print(ans)
a=int(input())
if a<105:
  print(0)
if 105<=a<135:
  print(1)
if 135<=a<165:
  print(2)
if 165<=a<189:
  print(3)
if 189<=a:
  print(4)
import numpy 

n = int(input())
num = [3,5,7,11,13,17,19,23,29,31,37]
k = len(num)
ans =0
for i in range(2 ** k):
    cnt = []
    for j in range(k):
        if ((i >> j)&1):
            cnt.append(num[j])
    if numpy.prod(cnt) <= n   and len(cnt) == 3  :
        ans += 1
print(ans)
a=int(input())
if a<=104:
    ans=0
elif a<135:
    ans=1
elif a<165:
    ans=2
elif a<169:
    ans=3
else:
    ans=4
print(ans)
n = int(input())

ans = 0
for i in range(1, n+1):
    if i % 2 == 0:
        continue
    cnt = 0
    for j in range(1, i+1):
        if i % j == 0:
            cnt += 1
    if cnt == 8:
        print(i)
        ans += 1
print(ans)
N = int(input())

def num_p(n):
  r = 0
  for i in range(1,n+1):
    if n % i == 0:
      r += 1
  return r

ans = 0
for i in range(1, N+1):
  if num_p(i) == 8:
    ans += 1
print(ans)
n=int(input())
odd=[]
for i in range(1,n+1):
  if i%2==1:
    odd.append(i)
x=len(odd)
l=[]
count=0
for j in range(1,n+1):
  for k in range(x):
    if odd[k]%j==0:
      l.append(j)
      if len(l)==8:
        count+=1
      k+=1
print(count)
import sys

n = int(sys.stdin.readline().rstrip("\n"))
count = 0
for num in range(24, n+1):
    divisor = 0
    for p in range(1, num):
        if num % p == 0:
            q = int((num - num % p)/ p)
            if q >= p:
                divisor += 1
            else:
                break
    if divisor == 8:
        count += 1
print(count)
n = int(input())
l = []
for j in range(1,n+1):
    if j%2 != 0:
        l.append(j)
a = 0
b = 0
for i in l:
    if n%i == 0:
        a += 1
    if a == 8:
        b += 1
print(b)
n=int(input())
count=0
ans=0
for j in range(1,n+1,2):
  count=0
  for i in range(1,int(j**0.5)):
    if j%i==0:
      if j//i!=i:
        count+=2
      else:
        count+=1
  if count==8:
    ans+=1
print(ans)
n = int(input())
cnt = 0
l = []
for i in range(1, n+1):
    if i % 2 == 1:
        for d in (1, i+1):
            if i % d == 0:
                l.append(i)
        if len(l) == 8:
            cnt += 1
print(cnt)
N = int(input())
if N < 105:
  print(0)
else:
  print(1)
N = int(input())

a = 0
b = []
for i in range(1, N+1):
  if N%i == 0:
    a += 1
  if a == 8 and N%2:
    b.append(a)
print(len(b))
n=int(input())
c=0
ans=0
for i in range(1,n+1):
    for j in range(1,n+1):
        if i%j==0:
            c+=1
    if c==8:
        ans+=1
    c=0
print(ans)
n=int(input())
ans=0
l=[i for i in range(1,n+1) if i%2==1]
for i in l:
    cnt=0
    for j in range(1,i//2+1):
        if i%j==0:
            cnt+=2
    if cnt==8:
        ans+=1
print(ans)
n = int(input())
a = n//2
ans = 0
for j in range(1,n+1):
    count = 1
    for i in range(1,a+1):
        if n % i == 0:
            count += 1
        if count >= 8 and i % 2 == 1:
            ans +=1
print(ans)
import sys

def divisor(num):
    cnt = 0
    for i in range(1, n+1):
        if(num % i == 0):
            cnt += 1
    return cnt


n = int(input())
ans = 0

if n <= 105:
    if n == 105:
        print(1)
    else:
        print(0)
    sys.exit()

for i in range(106, n+1):
    if (divisor(i) == 8 and i % 2 == 1):
        ans += 1
print(ans)
def divisor(n): 
    i = 1
    table = []
    while i * i <= n:
        if n % i == 0:
            table.append(i)
            table.append(n//i)
        i += 1
    table = list(set(table))
    return table

N = int(input())
total = 0

for n in range(1, N + 2, 2):
    if len(divisor(n)) == 8:
        total += 1

print(total)
N = int(input())

ans = 0

for i in range(1, N+1):
    cnt = 0
    for j in range(1, i):
        if i % j == 0:
            cnt += 1
    
    if cnt == 8:
        ans += 1

print(ans)
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(input())
a = [105,135,165,189,195]

if a[0] > n: print(0)
elif a[0] <= n < a[1]: print(1)
elif a[1] <= n < a[2]: print(2)
elif a[2] <= n < a[3]: print(3)
elif a[3] <= n < a[4]: print(4)
elif a[3] >= n: print(5)
import sys

def divisor(num):
    cnt = 0
    for i in range(1, n+1):
        if(num % i == 0):
            cnt += 1
    return cnt


n = int(input())
ans = 0

for i in range(106, n+1):
    if (divisor(i) == 8 and i % 2 == 1):
        ans += 1
print(ans)
n = int(input())
cnt = 0
for i in range(1, n+1, 2):
    if n % i == 0:
        cnt += 1
if cnt == 8:
    print(1)
else:
    print(0)
import sys

n = int(sys.stdin.readline().rstrip("\n"))
count = 0
for num in range(24, n+1):
    divisor = 0
    for p in range(1, num):
        if num % p == 0:
            q = int((num - num % p)/ p)
            if q > p:
                divisor += 1
            else:
                break
    if divisor == 8:
        count += 1
print(count)
n=int(input())
a=0
ans=0
if n < 105:
  print(0)

elif n == 105:
  print(8)
  
else:
  for i in range(107,n,2):
    a=0
    for j in range(i):
      if i%(j+1)==0:
        a += 1
    if a==8:
      ans +=1
  print(ans)
N = int(input())
ans = 0
if N >= 105: ans = 1
print(ans)
n = int(input())
ans = 0
for i in range(1, n+1, 2):
  c = 0
  for j in range(1, i):
    if i%j == 0:
      c += 1
  if c == 8:
    ans += 1
print(ans)
import itertools
N = int(input())

prime = [3,5,7,11,13,17,19,23]

ans_list = list(itertools.permutations(prime,3))
ans = []
for i in range(len(ans_list)):
    k = 1
    for j in range(3):
        k *= ans_list[i][j]
    if k <= N:
        ans.append(k)
print(len(list(set(ans))))
n = int(input())

con = 0
ans = 0

for j in range(1,n+1):
    for i in range(1,n+1):
        if j % 2 == 0:
            continue
        if j % i == 0:
            con += 1
            if con == 8:
                ans += 1

print(ans)
n = int(input())
if n<3*5*7:
    ans=0
elif n<3**3*5:
    ans=1
elif n<3*5*7:
    ans=2
elif n<3**3*7:
    ans=3
elif n<3*5*13:
    ans=4
else:
    ans=5
print(ans)
N = int(input())
if (1 <= N < 105):
    print(0)
if (105 <= N < 135):
    print(1)
if (135 <= N < 155):
    print(2)
if (155 <= N < 189):
    print(3)
if (189 <= N < 195):
    print(4)
else:
    print(5)
n = int(input())
cnt = 0
ans = 0

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


def 約数(n):
	count = 0
	for i in range(1,n):
		if n%i == 0:
			count += 1
	if count == 8:
		return True
	else:
		return
if n == 105:
	print(1)
elif n < 105:
	print(0)
else:
	ans = 1
	for i in range(106,n+1):
		if i%2 !=0:
			if 約数(i):
				ans += 1


	print(ans)
n = int(input())
if n>105:
  print(1)
else:
  print(0)
N=int(input())

if N<105:
    print(0)
    exit()

ans=1
for i in range(106,N):
    if i%2!=0:
        res=0
        for j in range(1,i+1):
            if i%j==0:
                res+=1
        if res==8:
            ans+=1
print(ans)
def actual(N):
    divisor_count = 0

    for i in range(1, N + 1):
        if N % i == 0:
            divisor_count += 1

    if divisor_count == 8:
        return 1

    return 0

N = int(input())
print(actual(N))
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

n=n0()

ans=0
for k in range(105,n+1,2):
    c=0
    for i in range(1,int(n**0.5)+1):
        if k%i==0:
            c+=2
    if i**2==k:
        c-=1
    if c==8:
        ans+=1
print(ans)
n = int(input())
ans_list = [i for i in range(n+1) if i%2!=0]
print(ans_list)
for i in ans_list:
  for j in range(1,n+1):
    count = 0
    ans = 0
    if i%j == 0:
      count += 1
    if count == 8:
      ans +=1
print(ans)
#ABC105-B
n = int(input())
divisor_list = []
ans = 0
for i in range(1,n+1):
    if(i % 2 != 0):
        if(n % i == 0):
            divisor_list.append(i)
if(len(divisor_list) == 8):
    ans += 1
print(ans)
n = int(input())
cnt = 0
l = []
for i in range(1, n+1):
    if i % 2 == 0:
        exit()
    else: 
        for j in range(1,n+1):
            if n % j == 0:
                l.append(j)
                if len(l) == 8:
                    cnt += 1
print(cnt)
n=input("n=")

s=0
yakusu=0



for i in range(1,int(n)+1):
    s=0
    if i%2!=0:
        for k in range(1,i+1):
            if i%k==0:
                s+=1    
    if s==8:
        yakusu+=1         

print(yakusu)
import math
n = int(input())
cnt = 0
for i in range(1, n+1, 2):
    divisor_num = 0
    for j in range(1, i+1):
        if n % j == 0:
            divisor_num += 1
    if divisor_num == 8:
        cnt += 1      
print(cnt)
N=int(input())
if N<105:
  print(0)
elif N<165:
  print(1)
elif N<195:
  print(2)
else:
  print(3)
N=int(input())
 
ans=0
odd=[]
for i in range(1,N+1):
  if i%2!=0:
    odd.append(i)
    
if N  <104:
  pass
elif N==105:
  ans=1
else:
  ans=1
  for i in range(106,N+1):
    if i%2!=0:
      tmp=0
      for j in odd:
        if i%j==0:
          tmp=+1
      if tmp==8:
        ans+=1 
print(ans)
import itertools
N = int(input())

prime = [3,5,7,11,13,17,19,23,29]

ans_list = list(itertools.permutations(prime,3))
ans = []
for i in range(len(ans_list)):
    k = 1
    for j in range(3):
        k *= ans_list[i][j]
    if k <= N:
        ans.append(k)
print(len(list(set(ans))))
import math 
n = int(input())
cnt = 0
if n ==1:
    print(cnt)
    exit()
for i in range(1,n+1):
    if n % i == 0:
       cnt += 1
print(cnt)
n = int(input())

ret = 0


for j in range(1,n+1,2):
    cnt = 0
    for i in range(1,j+1):
        if n % i == 0:
           cnt += 1
    if cnt == 8:
        ret += 1
print(ret)
N = int(input())

def NumOfFractional(n):
    ct = 0
    for i in range(1,n+1):
        if n%i==0:
            ct+=1
    return ct

for n in range(1,N+1):
    ct=0
    if n%2!=0 and NumOfFractional(n)==8:
        ct+=1
print(ct)
c = 0
n = int(input())
if n%2==1:
    for i in range(1,n+1):
        n%i == 0
        c += 1
        if c == 8:
            print('1')
            exit()
print('0')
in_num = int(input())
check_num = 1
ans_counter = 0

while check_num <= in_num:
	i = 1
	div_counter = 0
	while i <= check_num /3:
		if check_num % i == 0:
			div_counter += 1
		i += 2
	if div_counter == 8:
		ans_counter += 1
	check_num += 2

print(ans_counter)
N = int(input())
cnt = 0
odd_list = []
ans = 0

for i in range(201):
    if i %2 != 0:
        odd_list.append(i)

#print(odd_list)
for i in odd_list:
    if N % i == 0:
        cnt += 1
print(cnt // 8 )
def make_divisors(n):
    a,b =[],[]
    i = 1
    while i*i<=n:
        if n%i == 0:
            a.append(i)
            if i != n//i:
                b.append(n//i)
        i+= 1
    return a+b[::-1]

n = int(input())
if n % 2 == 1 and len(make_divisors(n))==8:
    print(1)
else:
    print(0)
N = int(input())
if N >= 195:
  print(4)
elif N >= 165:
  print(3)
elif N >= 135:
  print(2)
elif N >= 105:
  print(1)
else:
  print(0)
N = int(input())

count = 0
for i in range(N):
    divisor_count = 0
    for j in range(i + 1):
        if N % (j + 1) == 0:
            divisor_count += 1
    if divisor_count == 8:
        count += 1
print(count)
n = int(input())
cnt = 0
if n < 105:
    print(0)
    quit()
elif n == 105:
    print(1)
    quit()
else:
    ans = 0
    for i in range(107, n+1, 2):
        cnt = 0
        for j in range(1, i+1):
            if i % j == 0:
                cnt += 1
        if cnt == 8:
            ans += 1
    print(ans)
n = int(input())
cnt = 0
l = []
for i in range(1, n+1):
    if i % 2 == 1:
        for d in range(1, i+1):
            if i % d == 0:
                l.append(d)
        if len(l) == 8:
            cnt += 1
print(cnt)
n = int(input())

ans = 0

for i in range(1,n+1,2):
    con =0
    for j in range(1,n+1):
        if i % j == 0:
            con += 1
        if con == 8:
            ans += 1

print(ans)
n = int(input())
c = 0
for i in range(1, n, 2):
    tmp = 0
    for j in range(1, n, 2):
        if i % j == 0:
            tmp += 1
    if tmp == 8:
        c += 1
print(c)
n = int(input())

if n == 105:
	print(1)
else:
	print(0)
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

def main():
    N=int(input())
    tmp=0
    ans=0
    for i in range(1,N+1):
        if N%i==0:
            tmp+=1
    if tmp==8:
        ans+=1
    print(ans)

if __name__ == '__main__':
    main()
in_num = int(input())
check_num = 105
ans_counter = 0

if in_num < 105:
	print(0)

else:
	while check_num <= in_num:
		i = 1
		div_counter = 0
		while i <= check_num /2:
			if check_num % i == 0:
				div_counter += 1
			i += 2
		if div_counter == 8:
			ans_counter += 1
		check_num += 2

	print(ans_counter)
N = int(input())

res = 0

for i in range(1, N+1, 2):
  count = 0
  for j in range(2, N):
    if i % j == 0:
      count += 1
  if count == 6:
    res += 1

print(res)
N=int(input())
tmp=1
k=0
ans=0
for i in range(2, N + 1):
    while N % i == 0:
        N //= i
        k += 1
    tmp *= k+1
    k = 0
if tmp==8:
    ans+=1
print(ans)
import sys

n = int(sys.stdin.readline().rstrip("\n"))
count = 0
for num in range(27, n+1, 2):
    divisor = 0
    for p in range(1, num, 2):
        if num % p == 0:
            q = int((num - num % p)/ p)
            if q >= p:
                divisor += 1
            else:
                break
    if divisor == 8:
        count += 1
print(count)
a=int(input())
if a<105:
  print(0)
elif 105<=a<135:
  print(1)
elif 135<=a<165:
  print(2)
elif 165<=a<189:
  print(3)
elif 189<=a:
  print(4)
n=int(input())
cnt=0
a=[3,5,7,11,13,17,23]
for i in range(len(a)):
    for j in range(i+1,len(a)):
        for k in range(j+1,len(a)):
            if i*j*k <=n and i*j*k%2==1:
                cnt+=1
print(cnt)
ans=0
n=int(input())
if n<105:
  print('0')
else:
  for i in range(105,n+1):
    cnt=0
    for j in range(1,i+1):
      if i%j==0:
        cnt+=1
    if cnt==8:
      ans+=1

print(ans)
n=int(input())
if n<=104:
  print('0')
cnt=0
for i in range(105,n+1,2):
  if i in [105,135,165,189,195]:
    cnt+=1
print(cnt)
N = int(input())
cnt=0
y=[]

for i in range(1,N+1,2):
    for j in range(1,i):
        if i%j == 0:
            y.append(j)
    if len(y)==8:
        cnt += 1
        y.clear()
print(cnt)
number = int(input())

num_eight_divisors = 0

numbers = list(range(9, number + 1, 2))

for i in range(9, number + 1, 2):
    divisors = [1, i]

    for j in range(2, i):
        q, mod = divmod(i, j)

        if mod == 0:
            divisors.append(j)
            divisors.append(q)

    if len(set(divisors)):
        num_eight_divisors = num_eight_divisors + 1

print(num_eight_divisors)
import math
n = int(input())
ans = 0
for i in range(1, n+1, 2):
    count = 0
    for j in range(1,int(math.sqrt(i))):
        if i % j == 0:
            count += 1
    if count == 4:
        ans += 1
print(ans)
n = int(input())
a = 0
b = 0
for i in range(1,n+1):
    if n%i == 0:
        a += 1
    if a == 8:
        b += 1
print(b)
n = int(input())
def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

count = 0
for i in range(n+1):
  y = make_divisors(i)
  if len(y) == 8:
    count+=1
print(count)
'''
制約 1< n< 200
'''
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)

    # divisors.sort()
    return divisors



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

if n < 105:
    print(0)
    exit()
elif n == 105:
    print(1)
    exit()
else:
    num = 1
    for i in range(106, n):
        count = 0
        for j in range(1, n):
            if i % j == 0:
                count += 1
        if count == 8:
            num += 1
print(num)
n = int(input())

count = 0
for i in range(1,n+1):
  temp_count = 0
  for j in range(1,i+1):
    if i%j == 0:
      temp_count += 1
  if temp_count == 8:
    count += 1
    
print(count)
#ABC106

n = int(input())

# (1+p)(1+q)(1+r)
# 2*2*2=8
# (1+p+p^2+p^3)(1+q)
# 4*2=8

# p = [3,5,7,11,13,17,19]

# l = [3*5*7,3**3*5]

if n < 3*5*7:
    print(0)
elif n < 3**3*5:
    print(1)
else:
    print(2)
N = int(input())
if (1 <= N < 105):
    print(0)
if (105 <= N < 135):
    print(1)
if (135 <= N < 189):
    print(2)
if (189 <= N):
    print(3)
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

n=n0()

ans=0
for k in range(5,n+1):
    c=0
    for i in range(1,int(k**0.5)+1,2):
        if k%i==0:
            c+=2
    if i**2==k:
        c-=1
    if c==8:
        ans+=1
print(ans)
N=int(input())
u,v,w=0,0,0
count=0
ans=0
if N<104:
  print(ans)
  exit(0)
for i in range(104,N+1):
  for p in range(5):
      u=pow(3,p)
      for q in range(4):
          v=pow(5,q)
          for r in range(3):
              w=pow(7,r)
              if i%(u*v*w)==0:
                  count+=1
  if count==8:
    ans+=1
  count=0
print(ans)
import math
N=int(input())
ans=0
if N<105:
	print(0)
else:
	for i in range (105,N+1):
		tmp=[]
		if i%2==1:
			for j in range(1,int(math.sqrt(N)+1)):
				if i%j==0:
					tmp.append(j)
					tmp.append(1//j)
			if len(tmp)==8:
				#print(i)
				ans+=1
	print(ans)
N=int(input())

ans=0
for i in range(1,N+2,2):
    cnt=0
    for x in range(1,i+1):
        if i%x==0:
            cnt+=1
    if(cnt==8):
        ans+=1

print(ans)
n=int(input())
l=[3,5,7,11,13]
ans=[0]*10000
for i in range(3):
    for j in range(1,4):
        for k in range(2,5):
            ans[l[i]*l[j]*l[k]]=1
ans[135]=1
ans[189]=1
print(sum(ans[:n+1]))
N = int(input())
count_1 = 0
for i in range(1,N+1,2):
  count_2 = 0
  for j in range(1,i+1):
    if N % j == 0:
      count_2 += 1
  if count_2 == 8:
    count_1 += 1
print(count_1)
n = int(input())

if n >= 195:
  print(4)
elif n >= 165:
  print(3)
elif n >= 135:
  print(2)
elif n >= 105:
  print(1)
else:
  print(0)
a=int(input())
if a<=104:
    ans=0
elif a<165:
    ans=1
elif a<195:
    ans=2
else:
    ans=3
s = int(input())
if s < 104:
  print(0)
elif 105<= s <165:
  print(1)
elif 165 <= s <195:
  print(2)
else:
  print(3)
N = int(input())
res = 0
for i in range(1,N+1):
    div_cnt = 0
    for j in range(1,i+1):
        if i%j == 0:
            div_cnt += 1
    if div_cnt == 8:
        res += 1
print(res)
n=int(input())
ans=0
l=[105,135,165,189]
for i in range(n+1):
  if i in l:
    ans+=1
print(ans)
n = int(input())
g = 0
ans = 0
for i in range(n):
    for j in range(i):
        j = j +1
        if n % j == 0:
            g += 1
    if g == 9:
        ans += 1
print(ans)
n = int(input())

if n < 105:
    print(0)
elif n < 165:
    print(1)
else:
    print(2)
n=int(input())
if n<105:
  print(0)
elif n<135:
  print(1)
elif n<165:
  print(2)
else:
  print(3)
n = int(input())
cnt = 0
ans = 0

for i in range(1, n+1, 2):
    for j in range(1, n+1, 2):
        if(i%j == 0):
            cnt += 1
            if(cnt == 8):
                ans += 1
print(ans)