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)

def number_of_divisors(m)
	count = 1
	for i in 2..m/2
		if m%i == 0
			count += 1
		end
	end	
	if (m > 1)
		count += 1
	end
	return count
end

n = gets.chop.to_i

total_count = 0

for j in 1..n
	if j%2 == 1 && number_of_divisors(j) == 8
		total_count += 1
		puts j
	end
end

puts total_count.to_s