Problem: You have integer n. Calculate how many ways are there to fully cover belt-like area of 4n-2 triangles with diamond shapes. 

Diamond shape consists of two triangles. You can move, rotate or flip the shape, but you cannot scale it. 

2 coverings are different if some 2 triangles are covered by the same diamond shape in one of them and by different diamond shapes in the other one.

Please look at pictures below for better understanding.

<image> On the left you can see the diamond shape you will use, and on the right you can see the area you want to fill.

<image> These are the figures of the area you want to fill for n = 1, 2, 3, 4. 

You have to answer t independent test cases.

Input

The first line contains a single integer t (1 ≤ t ≤ 10^{4}) — the number of test cases.

Each of the next t lines contains a single integer n (1 ≤ n ≤ 10^{9}).

Output

For each test case, print the number of ways to fully cover belt-like area of 4n-2 triangles using diamond shape. It can be shown that under given constraints this number of ways doesn't exceed 10^{18}.

Example

Input


2
2
1


Output


2
1

Note

In the first test case, there are the following 2 ways to fill the area:

<image>

In the second test case, there is a unique way to fill the area:

<image>

Solution (in PYTHON3):

Solution:
########################################

#            SUBTRACTIONS              #

########################################

# for _ in range(int(input())):
#     a, b = map(int, input().split())
#     c = 0
#     while(min(a, b) != 0):
#         ma = max(a, b)
#         mi = min(a, b)
#         a = mi
#         b = ma
#         c += b//a
#         b = b % a
#     print(c)

########################################

#             CANDIES                 #

########################################

# from math import log2, floor, ceil
# for _ in range(int(input())):
#     a = int(input())
#     c = ceil(log2(a))
#     # print(c)
#     for i in range(c, 0, -1):
#         if((a//((2**i)-1)) == ceil(a/((2**i)-1))):
#             print((a//((2**i)-1)))
#             break

########################################

#         VASYA AND SOCKS              #

########################################

# a, b = map(int, input().split())
# c = (a-1)//(b-1)
# print(a+c)

########################################

#       MULTIPLY BY 2, DIVIDE BY 6     #

########################################

# for _ in range(int(input())):
#     n = int(input())
#     if(n == 1):
#         print(0)
#     else:
#         op = 0
#         while(True):
#             if(n % 6 == 0):
#                 n = n//6
#                 op += 1
#             elif((n-3) % 6 == 0):
#                 n = (n*2)//6
#                 op += 2
#             else:
#                 op = -1
#                 break
#             if(n == 1):
#                 break
#         print(op)

########################################

#      Kana and Dragon Quest game      #

########################################

# for _ in range(int(input())):
#     h, n, m = map(int, input().split())
#     if((h-(m*10)) <= 0):
#         print("YES")
#     else:
#         for i in range(n):
#             if(h <= 0):
#                 print("YES")
#                 break
#             h = (h//2)+10
#         if(h > 0):
#             if((h-(m*10)) <= 0):
#                 print("YES")
#             else:
#                 print("NO")

for _ in range(int(input())):
    print(int(input()))