//Ciurul lui Eratosthenes
#include <stdio.h>
#define INPUT "ciur.in"
#define OUTPUT "ciur.out"
#define MAXN 2000000
#define MAX 1000000

int N;
int prim[MAX], nr=1;

void ciur(int n)
{
	long long i, j;
	for(i = 1;(i<<1)+1 <= N; ++i)
		if(!prim[i])
			for(++nr, j = (i*i+i)<<1; (j<<1)+1 <= N; j += (i<<1)+1)
				prim[j] = 1;
}
int main()
{
	freopen(INPUT, "r", stdin);
	freopen(OUTPUT, "w", stdout);
	
	scanf("%d", &N);
	ciur(N);
	printf("%d\n", nr);
	
	return 0;
}