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 Rust (1.15.1) (judge verdict: Accepted)

fn divisor(n:i32) -> Vec<i32>{
    let mut v: Vec<i32> = Vec::new();
    let a = (n as f64).sqrt() as i32;
    for i in 1..a+1{
        if n%i != 0 {continue}
        v.push(i);
        if i*i == n{
            continue
        }
        v.push(n/i);
    }
    return v
}

fn main() {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    let n :i32 = s.trim().parse().unwrap();
    let mut ans = 0;
    for i in 1..n+1{
        if i%2 == 0 {continue}
        if divisor(i).len() == 8{
            ans += 1;
        }
    }
    println!("{}", ans);
}