#include<cstdio>
using namespace std;
int main()
{
	int n;
	scanf("%d",&n);
	int ans=0;
	for(int i=105;i<=n;i+=2){
			int an=0;
		for(int j=1;j<=i;j++){
			if(i%j==0)
					an++;
		}
			if(an>=8)
				ans++;
	}
	printf("%d\n",ans);
	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<cstdio>
using namespace std;
int main()
{
	int n;
	scanf("%d",&n);
	int ans=0;
	for(int i=105;i<=n;i+=2){
			int an=0;
		for(int j=1;j<=i;j++){
			if(i%j==0)
					an++;
		}
			if(an>=8)
				ans++;
	}
	printf("%d\n",ans);
	return 0;
}

```