output_description: Print the count.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: n = int(input())
  l = [i for i in range(1, n + 1) if i % 2 == 1]
  print(l)
  cnt = 0
  for w in l:
  i = w
  fct = []
  b, e = 3, 0
  while b * b < w:
          while i % b == 0:
          i = i // b
          e = e + 1
          if e > 0:
          fct.append((b, e))
          b, e = b + 1, 0
  if i > 1:
          fct.append((i, 1))
  if len(fct) > 1:
          r = 1
          for j in fct:
          r = r * (j[1] + 1)
  elif len(fct) == 1:
          r = fct[0][1] + 1
  else:
          r = 0
  if r == 8:
          print(w, fct, r)
          cnt += 1
  print(cnt)
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."}]