# a^n mod b
b = int(1e9 + 7)
def binpow(a, n):
res = 1
while n != 0:
if n & 1:
res = res * a % b
a = a * a % b
n >>= 1
return res
binpow(11 , 10)
// a^n mod b
const int b = 1e9 + 7;
long long binpow(long long a, int n) {
long long res = 1;
while (n != 0) {
if (n & 1)
res = res * a % b;
a = a * a % b;
n >>= 1;
}
return res;
}