bool Btest(int a, int n) {
int s = 0, t = n - 1;
do {
++s;
t /= 2;
} while (t % 2 == 1);
int x = int(pow(a, t)) % n;
if (x == 1 || x == n - 1)return true;
for (int i = 1; i <= s - 1; ++i) {
x = x * x % n;
if (x == n - 1)
return true;
}
return false;
}