output_description: Print the count.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: 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]))
  
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."}]