Let denote the sum of the elements of a set , and let be the sum of all values over all subsets of the set consisting of the first natural numbers. For example,
For a given integer , find the value of the sum F(1) + F(2) + \dots + F(n).
The first line contains the number of test cases t~(t \le 1000). Each of the following lines contains one integer n~(1 \le n \le 10^9).
Print lines — one number per line for each corresponding test case. Since the answers may be very large, print them modulo .
Örnek 1