#include <bits/stdc++.h>
using namespace std;
int n,a,b,c,i,j,k;
int main(){
  for(cin>>n,i=1;i<=n;a+=(c==8?1:0),i+=2)for(c=0,j=1;j<=i;j++)if(i%j==0)c++;
  cout<<a;
}
### Prompt

Please create a solution in cpp 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 n,a,b,c,i,j,k;
int main(){
  for(cin>>n,i=1;i<=n;a+=(c==8?1:0),i+=2)for(c=0,j=1;j<=i;j++)if(i%j==0)c++;
  cout<<a;
}
```