#include<iostream>
using namespace std;
int main(){
  int a,b;
  int ans = 0;
  cin>>a;
  for(int i=105;i<=a;i+=2){
    b=0;
    for(int r=1;r<=i;r+=2) if(i%r==0) b++;
    if(b==8) ans++;
  }
    cout<<ans<<endl;
}
### Prompt

Develop a solution in CPP 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<iostream>
using namespace std;
int main(){
  int a,b;
  int ans = 0;
  cin>>a;
  for(int i=105;i<=a;i+=2){
    b=0;
    for(int r=1;r<=i;r+=2) if(i%r==0) b++;
    if(b==8) ans++;
  }
    cout<<ans<<endl;
}
```