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>
#include <thread>
#include <chrono>
#include <random>
#include <fstream>
#include <time.h>

#define ll long long int
#define pr(x) (std::cout << x << std::endl)



int main()
{
    ll n;
    std::cin >> n;


    std::vector<int> v(200, 0);
    for(int i=0; i<200; i++){
        ll tmp = i+1, c = 1;
        while(tmp*c <= 200){
            v[tmp*c-1]++;
            c++;
        }
    }

    ll ans = 0;
    for(int i=0; i<n; i=i+2){
        if(v[i]==8) ans++;
    }
    pr(ans);
    return 0;
}