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)

def divisor_counter(num)
  counter = 0
  (1..num).each do |n_value|
    counter += 1 if num % n_value == 0
  end
  counter
end

n = gets.chomp.to_i
odd_nums = []

odd_num = 1
result_counter = 0

while odd_num <= n
  odd_nums << odd_num
  odd_num += 2
end

odd_nums.each do |num|
  result_counter += 1 if divisor_counter(num) == 8
end

print result_counter