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 main() {
    let n: i32 = read();

    let mut total_count = 0;

    // 1以上N以下の整数
    for i in 1..(n + 1) {
        if i % 2 == 0 {
            // 偶数は対象外
            continue;
        }
        // 整数iの約数の個数を調べる
        let mut count = 0;
        for j in 1..(i + 1) {
            if i % j == 0 {
                count += 1;
            }
        }

        if count == 8 {
            total_count += 1;
        }
    }

    println!("{}", total_count);
}

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