output_description: Print the count.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: def Div(N):
      L = []
      R = []
      I = 1
      while I * I <= N:
          if N % I == 0:
              L.append(I)
              if I != (N // I):
                  R.append(N // I)
          I += 1
      return L + R[::-1]
  
  
  N = int(input())
  Count = 0
  for T in range(1, N + 1, 2):
      if len(Div(T)) == 8:
          Count += 1
  print(Count)
  
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."}]