Sumo and Luxury Car
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

As we all know, Sumo has a lot of luxury cars, Maserati, Porsche, Lincoln, and so on. Countless cars are parked in his garage. He is worried about what kind of car he drives every day. Can you help him?

Sumo has a total of n cars. Every day, he will choose any number of cars from the n cars (the number of cars cannot be 0) to form a team, and then choose one from this team to drive himself. How many options are there?

If the selected team set is different or the car he chooses is different, it is considered to be two different plans.

输入描述:

The first line of the input is a single integer which is the number of test cases. T test cases follow.

Each test case has  a single integer , representing the total number of luxury cars in Sumo.

输出描述:

For each test case, print a single line containing an integer modulo .
示例1

输入

复制 
2
1
2

输出

复制 
1
4

备注:

In the second sample, Sumo has four situations to drive:
Choose cars with numbers 1 and 2, drive the car with number 1,
Choose cars with numbers 1 and 2, drive the car with number 2,
Choose the car with numbers 1, drive the car with number 1,
Choose the car with numbers 2, drive the car with number 2.
So the answer is 4.