#include <fstream>

std::ifstream f("ciur.in");
std::ofstream g("ciur.out");

const int NMAX = 2000005;
int n,sol;
bool prime[NMAX];

void sieve(){
    
    prime[0] = prime[1] = 1;
    
    for(int i = 4;i <= n;i += 2)
        prime[i] = 1;
    
    for(int i = 3;i * i <= n;i += 2)if(!prime[i])
        for(int j = i + i;j <= n;j += i)
            prime[j] = 1;
}

int main(){
    
    f >> n;
    
    sieve();
    
    for(int i = 1;i <= n;++i)
        if(!prime[i])
           sol++;
    
    g << sol;
    
    return 0;
}