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)

=begin
－－－－－－－－－－－－－－
  n = 入力値
  num = nの奇数のみ配列
  cnt = 約数の個数
  ans[] =  奇数かつ約数が"ちょうど8個"ある整数を格納
－－－－－－－－－－－－－－
  1: 1 ~ n までを繰り返す(i)
  2: i が奇数の場合、iの約数を数える
  3: i の約数が"ちょうど8個"の場合のみ ans に代入
  4: ansの要素数を出力
=end

def cnt_divisor(num)
  cnt = 1;
  for i in 2..num do
    cnt += 1 if num % i == 0
  end
  return cnt
end

n = gets.to_i;
num = (1..n).select{|v| v.odd?};
ans = [];

num.each do |num|
  ans << num if cnt_divisor(num) == 8;
end

puts ans.size;