GRIDISLANDS

https://www.algospot.com/judge/problem/read/GRIDISLANDS

algospot.com :: GRIDISLANDS

INPUT : n

OUTPUT : 2 ^ ( edge - 1 )

#include 

void pow(unsigned long long &OUTPUT, int n)
{
	for (int i = 0; i < n; i++)
	{
		OUTPUT *= 2;
		OUTPUT %= 20090711;
	}
}
int main()
{
	int CASE, N;
	for (scanf("%d", &CASE); CASE > 0; CASE-- )
	{
		scanf("%d", &N);
		int TOTALBRIDGE = (2 * N + 1)*((2 * N + 1)/2) + N + 1;
		unsigned long long OUTPUT = 1;
		
		pow(OUTPUT, (TOTALBRIDGE - 1));

		printf("%I64d\n", OUTPUT);
	}
	return 0;
}