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