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 main()
{
	int i,j,n,num;
	cin>>n;
	int flag=0;
	for(i=1;i<=n;i++)
	{
		num=0;
		for(j=1;j<=i;j++)
			if(i%j==0&&j%2==1)
				num++;
		if(num==8)
			flag++;
	}
	cout<<flag<<endl;
	return 0;
}