output_description: Print the count.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: 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)
problem_description: Statement
  
  The number 105 is quite special - it is odd but still it has eight divisors.
  Now, your task is this: how many odd numbers with exactly eight positive
  divisors are there between 1 and N (inclusive)?
samples: [{"input": "105", "output": "1\n    \n\nAmong the numbers between 1 and 105, the only number that is odd and has\nexactly eight divisors is 105.\n\n* * *"}, {"input": "7", "output": "0\n    \n\n1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there\nis no number that satisfies the condition."}]