Problem:
Score: 200 points

Problem 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)?

Constraints

N is an integer between 1 and 200 (inclusive).

Input

Input is given from Standard Input in the following format:

N

Output

Print the count.

Sample Input 1

105

Sample Output 1

1

Among the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.

Sample Input 2

7

Sample Output 2

0

1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.

Solution in Ruby (2.3.3) (judge verdict: Wrong Answer)

require 'prime'
n = gets.chomp.split(' ').map(&:to_i)[0]
c = 0
ps = Prime.each(200).to_a
for i in 3..n do
  if i.odd? && !ps.include?(i)
    s = 0
    qs = []
    Prime.prime_division(i).map { |l| qs << l[1] }
    qs.map { |q| s += q }
    s = 2**s
    qs.each do |q|
      s = s / q
    end
    puts "#{i} #{s}"
    c += 1 if s == 8
  end
end
puts c