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)

use std::io::*;
fn main() {
	let a = read();
	let mut count_b = 0;
	if a < 105 {
		println!("0");
	} else if a == 105 {
		println!("1");
	} else {
		for c in 105..a + 1{
			let mut count_a = 1;
			for d in 1..(c / 2) + 1 {
				if c % d == 0 {
					count_a += 1;
				}
			}
			if count_a == 8 && c % 2 == 1 {
				count_b += 1;
			}
		}
		println!("{}", count_b);
	}
}

fn read() -> usize{
    let s = stdin();
    let b = s.bytes()
        .map(|c| c.unwrap() as char)
        .take_while(|c| !c.is_whitespace())
        .collect::<String>();
    b.parse().ok().unwrap()
}