int
ModPow(
int
a,
int
b,
int
n)
{
int
rec=1;
while
(b)
{
if
(b & 1)
rec = (rec * a) % n;
a = (a * a) % n;
b >>= 1;
}
return
rec % n;
}
int
ModPow(
int
a,
int
b,
int
n)
{
int
rec=1;
while
(b)
{
if
(b & 1)
rec = (rec * a) % n;
a = (a * a) % n;
b >>= 1;
}
return
rec % n;
}