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

