int isprime[maxn],primes[maxn],mu[maxn],len;
void Get_mu()
{
mu[1] = 1,len = 0;
for ( int i=2 ; i<maxn ; i++ )
isprime[i] = 1;
for ( int i=2 ; i<maxn ; i++ )
{
if ( isprime[i] )
primes[++len] = i,mu[i] = -1;
for ( int j=1 ; j<=len ; j++ )
{
if ( i*primes[j]>maxn )
break;
isprime[i*primes[j]] = 0;
if ( i%primes[j]==0 )
{
mu[i*primes[j]] = 0; break;
}
else
{
mu[i*primes[j]] = -mu[i];
}
}
}
for ( int i=2 ; i<maxn ; i++ )
mu[i] += mu[i-1];
}