bool vis[maxn];
int prime[maxn];
int getprinme( int n )
{
int m = sqrt( n+0.5 );
int c = 0;
memset( vis,0,sizeof(vis) );
for( int i = 2; i <= m; i ++ ){
if( !vis[i] )
{
prime[c++] = i;
for( int j = i*i; j <= n; j += i )
vis[j] = 1;
}
}
for( int i = m+1; i <= n; i ++ )
if( !vis[i] )
prime[c++] = i;
return c;
}