#描述#
Sperner is an industrious boy excelling at solving mathematical problems. This time he encountered a tough problem concerning about sets, hence your help will be of great value.
<BR>
<BR>
Given a set A with a size n, and you can create a set B whose elements are subsets of A. But you should guarantee that the element s of B don’t belong to each other, which displays the constraint that if u and v belong to B, then u is not a subset of v and vice versa(note that B is a set formed by subsets of A).
<BR>
<BR>
Here comes the real problem, what is the maximum size of B?

#格式#
##输入格式##
The first line of input contains a number T (1&ltT&lt50), which is the number of test cases. Each of the following T lines contains one integer n (1&lt=n&lt=50), which is the size of A.

##输出格式##
For each test case, print a line the maximum size of B corresponding to n, the size of A.

#样例1#
##样例输入1##

2
1
2

##样例输出1##

1
2

#限制#
1000ms
32768KB

#提示#

#来源#
Limitfan