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 C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<iostream>
using namespace std;

int main() {
    int N;
    cin >> N;
    if (N < 105) {
        cout << 0 << endl;
    }
    else if (N >= 105 && N < 135){
        cout << 1 << endl;
    }
    else if (N >= 135 && N < 165) {
        cout << 2 << endl;
    }
    else if (N >= 165 && N < 189) {
        cout << 3 << endl;
    }
    else if (N >= 189 && N < 195) {
        cout << 4 << endl;
    }
    else {
        cout << 5 << endl;
    }
    return 0;
}