#include <iostream>
#include <bitset>
#define MAX 2000002

using namespace std;

bitset<MAX> prime;
int n, cnt;

int main(){
	prime.set();
	freopen("ciur.in", "r", stdin);
	freopen("ciur.out", "w", stdout);
	scanf("%d", &n);
	for(int i = 2; i <= n; i++){
		if(prime[i]){
			cnt++;
			for(int j = i * i; j <= n; j++){
				if(j % i == 0){
					prime[j].flip();
				}
			}
		}
	}
	printf("%d\n", cnt);
	return 0;
}