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: Accepted)

N = gets.to_i

A = Array.new(200 + 1){ [] }
ODD = (1 .. 200).select{|i| i.odd? }.to_a

ODD.each do |i|
  ODD.each do |j|
    break if i * j > N
    A[i * j] << i << j
  end
end
A.each{|cmp| cmp.uniq!}
puts ODD.count{|i| A[i].size == 8 && i <= N}