#include<iostream>
using namespace std;
int main(){
  int n,m=0;
  cin >> n;
  if(n >= 105) m++;
  if(n >= 135) m++;
  if(n >= 165) m++;
  if(n >= 189) m++;
  if(n >= 195) m++;
  cout << m << endl;
  return 0;
}
### Prompt

Please provide a cpp coded solution to the problem described below:

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,m=0;
  cin >> n;
  if(n >= 105) m++;
  if(n >= 135) m++;
  if(n >= 165) m++;
  if(n >= 189) m++;
  if(n >= 195) m++;
  cout << m << endl;
  return 0;
}
```