SP11383 FAST2 - Fast Sum of two to an exponent

There is people that really like to do silly thinks, one of them is sum the numbers from 2^0 to 2^n, task is actually really simple, just do a ultra fast sum of term 2^0 to 2^n

the first line starts with a number, T, wich is the number of test cases, T lines will follow each line contains a number "n" that is the nth term of the sum from 2^0 to 2^n 0

Output the sum from 2^0 to 2^n MODULO 1298074214633706835075030044377087