#include <stdio.h>
#include <bitset>
#define nMax 1048575

using namespace std;

bitset <1048576>prim;
long i,j,t,q,p[80000];
long n;

int main(){
    freopen("fractii.in","r",stdin);
    freopen("ractii.out","w",stdout);
    
    //preproc
    //numere prime;
    prim.set();
    prim[1]=0;
    for (i=2;i<=nMax;i++)
        if (prim[i]){
           p[++q]=i;
           t=nMax/i;
           for (j=2;j<=t;j++)
               prim[i*j]=0;
        }
    
    scanf("%ld",&n);
    
return 0;
}