#include <iostream>
using namespace std;
int main() {
  int N;
  cin >> N;
  int cnt = 0;
  if(N >= 105) cnt++;
  if(N >= 135) cnt++;
  if(N >= 165) cnt++;
  if(N >= 195) cnt++;
  if(N >= 189) cnt++;
  cout << cnt << 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;
  int cnt = 0;
  if(N >= 105) cnt++;
  if(N >= 135) cnt++;
  if(N >= 165) cnt++;
  if(N >= 195) cnt++;
  if(N >= 189) cnt++;
  cout << cnt << endl;
  return 0;
}
```