打表找规律即可
1 = 1*2
6 = 2*3
20 = 4*5
72 = 8*9
...
#include <cstdio>
#include <algorithm>
using namespace std;
const int MOD = 10007;
int fp(int a, int b)
{
int ans = 1;
a %= MOD;
while(b)
{
if(b&1) ans = ans * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ans;
}
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
int n;
scanf("%d", &n);
int ans = fp(2, n-1) * (fp(2, n-1) + 1) % MOD;
printf("%d\n", ans);
}
return 0;
}