#include <bits/stdc++.h>
using namespace std;
vector <int> Q;
int Ld[2000013],sol(0),n;

int main()
{
 ifstream cin("ciur.in");
 ofstream cout("ciur.out");
 cin>>n;
 for (int i=2;i<=n;++i)
	{
	 if (Ld[i]==0) 
	      {
		  Ld[i]=i; 
		  Q.push_back(i);
	      }
	 for (int j=0;j<Q.size() && i*Q[j]<=n && Q[j]<=Ld[i] ; ++j)
	   Ld[i*Q[j]]=Q[j];
	}
 for (int i=2;i<=n;++i) 
    if (Ld[i]==i) ++sol;
 cout<<sol;
 return 0;
}