#include<cstdio>
#define MAX_N 2000000
using namespace std;

bool prim[MAX_N+1];

int main() {
    int n, i, j, cnt;
    FILE* fin, *fout;
    fin = fopen("ciur.in","r");
    fout = fopen("ciur.out","w");
    fscanf(fin,"%d",&n);
    cnt = 0;
    for(i = 2; i <= n; i++) {
        if(prim[i] == 0) {
            cnt++;
            for(j = 2*i; j <= n; j += i)
                prim[j] = 1;
        }
    }
    fprintf(fout,"%d\n",cnt);
    fclose(fin);
    fclose(fout);
    return 0;
}