You are given an integer N(0≤N≤105), you have to find the remainder when F(N) is divided by 109+7. More formally, you have to find the value of F(N)mod(109+7)
Definitions:
(kN) means how many ways can you choose k elements from N different elements when order doesn't matter.
Examples:
(00)=1
(25)=10
(34)=4
(45)=5
(55)=1
⊕ is the XOR (Exclusive-OR) operator. XOR outputs 1 when the two input bits are different. The truth table for XOR:
Example:
4⊕3=7
3⊕2=1
3⊕3=0
Input
The first line of the input will contain a single integer T (1≤T≤104) denoting the number of test cases. On the next T lines, there will be a single integer N (0≤N≤105).
Output
For each test case, print the answer in a single line.