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 main() {
    b();
}

fn first_words(s: &String) -> usize  {
    let bytes = s.as_bytes();
    for (i,&item) in bytes.iter().enumerate() {
        if item == b' ' {
            return i;
        }
    }
    s.len()
}

fn a() {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    let nums: Vec<i32> = s.trim().split_whitespace().map(|e| e.parse().ok().unwrap()).collect();
    println!("{}",(nums[0] - 1)*(nums[1] - 1));
}

fn b() {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    let num: i32 = s.trim().parse().unwrap();
    if num < 105 {
        println!("{:?}",0);
    } else if num < 135 {
        println!("{:?}",1);
    } else if num < 165 {
        println!("{:?}",2 );
    } else if num < 189 {
        println!("{:?}",3 );
    } else if num < 195 {
        println!("{:?}",4 );
    } else {
        println!("{:?}",5 );
    }

}