#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main(){
    int n;
    fin >> n;
    int prime[n+1]={};
    prime[1] = 1;
    for(int i = 2; i <=n; i++){
        if(prime[i] == 0){
            for(int j = 2*i; j<=n; j+=i) prime[j] = 1;
        }
    }
    int cnt =0;
    for(int i = 2; i<=n; i++){
        if(prime[i] == 0) cnt++;
    }
    fout << cnt;

    return 0;
}