A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and n, inclusive.

Input

Input contains one integer number n (1 ≤ n ≤ 3000).

Output

Output the amount of almost prime numbers between 1 and n, inclusive.

Examples

Input

10


Output

2


Input

21


Output

8
#include <bits/stdc++.h>
using namespace std;
int main() {
  int primes[3001] = {0};
  for (int q = 2; q <= 1500; q++) {
    if (primes[q] == 0) {
      for (int w = q * 2; w <= 3000; w += q) {
        primes[w]++;
      }
    }
  }
  int results[3001] = {0};
  for (int q = 2; q <= 1500; q++) {
    if (primes[q] == 0) {
      for (int w = q; w < 3001; w += q) {
        results[w] += 1;
      }
    }
  }
  int n;
  cin >> n;
  int result = 0;
  for (int q = 2; q <= n; q++) {
    if (results[q] == 2) {
      result++;
    }
  }
  cout << result;
  return 0;
}
