#include <iostream>

using namespace std;

int main() {
    int n;
    cin >> n;
    cout << (n >= 105) + (n >= 135) + (n >= 165) + (n >= 189) + (n >= 195) << endl;
    return 0;
}

### Prompt

Please create a solution in CPP to the following problem:

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.

Examples

Input

105


Output

1


Input

7


Output

0

### Response

```cpp
#include <iostream>

using namespace std;

int main() {
    int n;
    cin >> n;
    cout << (n >= 105) + (n >= 135) + (n >= 165) + (n >= 189) + (n >= 195) << endl;
    return 0;
}

```