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)

n=gets.to_i
i=0
ret=0
def factor_sub(n, m)
    c = 0
    while n % m == 0
      c += 1
      n /= m
    end
    return c, n
  end
  
  def factorization(n)
    buff = []
    c, m = factor_sub(n, 2)
    buff.push [2, c] if c > 0
    x = 3
    while x * x <= m
      c, m = factor_sub(m, x)
      buff.push [x, c] if c > 0
      x += 2
    end
    buff.push [m, 1] if m > 1
    buff
  end
def hoge(n)
    factorization(n).reduce(1){|m,xs|m*=xs[1]+1}
end

while(i<=n/2) do
    a=i*2+1
    if (hoge(a)==8)
        ret+=1
    end
    i+=1
end
p ret