output_description: Print the count.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: N = int(input())
  lis = [i for i in range(2, N + 1) if i % 2 == 1]
  ans2 = 0
  check = 0
  for one in lis:
      Prime = []
      count = []
      t = 0
      ans1 = 1
      for k in range(2, one + 1):
          while (one % k) == 0:
              one //= k
              if k in Prime:
                  count[Prime.index(k)] += 1
              else:
                  Prime.append(k)
                  count.append(1)
                  t += 1
      for j in range(0, t):
          ans1 *= count[j] + 1
      if ans1 == 8:
          ans2 += 1
  print(ans2)
  
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."}]