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
#include<iostream>
using namespace std;
int a[210];
int main()
{
	int n=0,sum=0,j=0;
	cin>>n;
	for(int i=1;i<=n;i=i+2)
	{
		j=1;
		while(j*i<=n)
		{
			++a[j*i];
			j=j+2;
		}
		if(a[i]==8)++sum;
	}
	cout<<sum<<endl;
}