#include<bits/stdc++.h>
using namespace std;
int main(){
	int n,tmp=0;
	cin>>n;
	for(int i=105;i<=n;i+=2){
		int cnt=2;
		for(int j=2;j<i;j++) if(i%j==0) cnt++;
		if(cnt==8) tmp++;
	}
	cout<<tmp<<endl;
	return 0;
}

### Prompt

Your challenge is to write a Cpp solution 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<bits/stdc++.h>
using namespace std;
int main(){
	int n,tmp=0;
	cin>>n;
	for(int i=105;i<=n;i+=2){
		int cnt=2;
		for(int j=2;j<i;j++) if(i%j==0) cnt++;
		if(cnt==8) tmp++;
	}
	cout<<tmp<<endl;
	return 0;
}

```