On the eve of Diwali, Hari is decorating his house with a serial light bulb set. The serial light bulb set has N bulbs placed sequentially on a string which is programmed to change patterns every second. If atleast one bulb in the set is on at any given instant of time, how many different patterns of light can the serial light bulb set produce?
Note: Lighting two bulbs *-*  is different from **- 


Input
The first line contains the number of test cases T, T lines follow.
Each line contains an integer N, the number of bulbs in the serial light bulb set.

Output
Print the total number of patterns modulo 10^5

Constraints

1 <= T <= 1000
0< N < 10^4

 

Example
Input:
2
1
2

Output:
1
3
 

Explanation
Case 1: 1 bulb can be lit in only 1 way. 
Case 2: 2 bulbs can be lit in -*  , *-   ,     ** i.e. 3 ways.
t=int(raw_input())
for i in range(t):
    n=int(raw_input())
    print (pow(2,n,100000)-1%100000)%100000