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<bits/stdc++.h>
using namespace std;


int main() {
	
	int N, cnt=0;
	cin >> N;
	for(int i=1; i<=N; i+=2){
		int dcnt=0;
		for(int j=1; j<=i; j++){
			if(i%j==0) dcnt++;
		}
		if(dcnt==8) cnt++;
	}
	cout << cnt << endl;
	
	return 0;
}