#include <stdio.h>
 
int N, cnt;
 
int prim(int X)
{
    int i;
 
 	if(X % 2 == 0)
 		return 0;
    for (i = 3; i * i <= X; i=i+2)
        if (X % i == 0)
            return 0;
    return 1;
}
 
int main(void)
{
    int i;
    int cnt =0;

    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);
 
    scanf("%d", &N);
    
    if(N >= 2) cnt++;
    
    for (i = 3; i <= N; i=i+2)
        if (prim(i))
            ++cnt;
    printf("%d\n", cnt);
 
    return 0;
}