#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,s=0;
	cin>>n;
	if(n>=105)
	s++;
	if(n>=135)
	s++;
	if(n>=189)
	s++;
	if(n>=195)
	s++;
	if(n>=165)
	s++;
	cout<<s;
	return 0;
	
	
}
### Prompt

Develop a solution in CPP 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<bits/stdc++.h>
using namespace std;
int main()
{
	int n,s=0;
	cin>>n;
	if(n>=105)
	s++;
	if(n>=135)
	s++;
	if(n>=189)
	s++;
	if(n>=195)
	s++;
	if(n>=165)
	s++;
	cout<<s;
	return 0;
	
	
}
```