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.42.0) (judge verdict: Accepted)

fn solve(n: u8) -> u8 {
    let mut result = 0;
    fn f(n: u8) -> u8 {
        let mut result = 1;
        for x in 1..=(n / 2) {
            if n % x == 0 { result += 1 }
        }

        result
    }
    for x in (1..=n).step_by(2) {
        if f(x) == 8 { result += 1 }
    }
    result
}

fn main() {
    let n = read_1();

    println!("{}", solve(n));
}

fn read_1<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}