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:
# WHERE: https://codeforces.com/problemset/page/4?order=BY_RATING_ASC

# 1
# Football
# https://codeforces.com/problemset/problem/96/A
# Input
# The first input line contains a non-empty string consisting of characters "0" and "1", which represents players. The length of the string does not exceed 100 characters. There's at least one player from each team present on the field.
# Output
# Print "YES" if the situation is dangerous. Otherwise, print "NO".

# listPlayers = input()
# currentTeam = 1

# for playerIndex in range(1, len(listPlayers)):
#     if currentTeam == 7:
#         break
#     if listPlayers[playerIndex - 1] == listPlayers[playerIndex]:
#         currentTeam += 1
#     else:
#         currentTeam = 1

# if currentTeam == 7:
#     print("YES")
# else:
#     print("NO")
# ---------------------------------------------------------------------------------------------------------------------

# 2
# Twins
# https://codeforces.com/problemset/problem/160/A
# Input
# The first line contains integer n (1 ≤ n ≤ 100) — the number of coins. The second line contains a sequence of n integers a1, a2, ..., an (1 ≤ ai ≤ 100) — the coins values. All numbers are separated with spaces.
# Output
# In the single line print the single number — the minimum needed number of coins.

# OTHER SOLUTION
# There is a better way to do it, sort the list, and add to my coins the until is greater than the sum of all the coins - the coins i removed

# def getIndexMaxNumber(listNumber):
#     maxIndex = 0
#     for i in range(1, len(listNumber)):
#         if listNumber[i] > listNumber[maxIndex]:
#             maxIndex = i
#     return maxIndex


# def getIndexLessNumber(listNumber):
#     lessIndex = 0
#     for i in range(1, len(listNumber)):
#         if listNumber[i] < listNumber[lessIndex]:
#             lessIndex = i
#     return lessIndex


# def sumCoins(listCoins):
#     sum = 0
#     for i in range(0, len(listCoins)):
#         sum += listCoins[i]
#     return sum


# numCoins = int(input())
# coins = list(map(int, input().split()))
# myCoins = []
# broCoins = []
# currentIndex = 0
# for i in range(numCoins):
#     maxCoinIndex = getIndexMaxNumber(coins)
#     lessCoinIndex = getIndexLessNumber(coins)
#     if sumCoins(myCoins) <= (sumCoins(broCoins) + coins[maxCoinIndex]):
#         myCoins.append(coins[maxCoinIndex])
#         del coins[maxCoinIndex]
#     else:
#         broCoins.append(coins[lessCoinIndex])
#         del coins[lessCoinIndex]
# print(len(myCoins))

# ---------------------------------------------------------------------------------------------------------------------

# 3
# HQ9+
# https://codeforces.com/problemset/problem/133/A
# Input
# The input will consist of a single line p which will give a program in HQ9+. String p will contain between 1 and 100 characters, inclusive. ASCII-code of each character of p will be between 33 (exclamation mark) and 126 (tilde), inclusive.
# Output
# Output "YES", if executing the program will produce any output, and "NO" otherwise.

# listPlayers = input()
# if "H" in listPlayers or "Q" in listPlayers or "9" in listPlayers:
#     print("YES")
# else:
#     print("NO")
# ---------------------------------------------------------------------------------------------------------------------

# 4
# Kefa and First Steps
# https://codeforces.com/problemset/problem/580/A
# Input
# The first line contains integer n (1 ≤ n ≤ 105).
# The second line contains n integers a1,  a2,  ...,  an (1 ≤ ai ≤ 109).
# Output
# Print a single integer — the length of the maximum non-decreasing subsegment of sequence a.

# cuantItems = int(input())
# itemsList = list(map(int, input().split()))

# maxSequenceCounter = 1
# prevMax = 1
# for idx in range(1, len(itemsList)):
#     if itemsList[idx - 1] <= itemsList[idx]:
#         maxSequenceCounter += 1
#     else:
#         maxSequenceCounter = 1
#     if prevMax < maxSequenceCounter:
#         prevMax = maxSequenceCounter
# print(prevMax)
# ---------------------------------------------------------------------------------------------------------------------

# 5
# Even Odds
# https://codeforces.com/problemset/problem/318/A
# Input
# The only line of input contains integers n and k (1 ≤ k ≤ n ≤ 1012).
# Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.
# Output
# Print the number that will stand at the position number k after Volodya's manipulations.

# inputFromUser = list(map(int, input().split()))
# maxNumber = inputFromUser[0]
# n = inputFromUser[1]
# number = 0
# if maxNumber % 2 == 0:
#     if n <= maxNumber//2:
#         number = 2*n - 1
#     else:
#         number = 2*n - maxNumber
# else:
#     if n <= (maxNumber - (maxNumber // 2)):
#         number = 2*n - 1
#     else:
#         number = 2*n - maxNumber - 1
# print(number)

# ---------------------------------------------------------------------------------------------------------------------

# 6
# Gravity Flip
# https://codeforces.com/problemset/problem/405/A

# counter = input()
# cols = list(map(int, input().split(" ")))
# cols.sort()
# answer = str(cols[0])
# for idx in range(1, len(cols)):
#     answer += " " + str(cols[idx])
# print(answer)

# ---------------------------------------------------------------------------------------------------------------------

# 7
# userEntry = list(map(int, input().split()))
# students = userEntry[0]
# puzzels = userEntry[1]

# puzzelsList = list(map(int, input().split()))
# puzzelsList.sort()
# times = puzzels - students + 1
# smallerDif = -1
# for time in range(times):
#     actualDif = abs(puzzelsList[time] - puzzelsList[time + (students - 1)])

#     if actualDif < smallerDif or smallerDif == -1:

#         smallerDif = actualDif
# print(smallerDif)
# ---------------------------------------------------------------------------------------------------------------------
# 8
# Dubstep
# https://codeforces.com/problemset/problem/208/A
# Input
# The input consists of a single non-empty string, consisting only of uppercase English letters, the string's length doesn't exceed 200 characters. It is guaranteed that before Vasya remixed the song, no word contained substring "WUB" in it; Vasya didn't change the word order. It is also guaranteed that initially the song had at least one word.
# Output
# Print the words of the initial song that Vasya used to make a dubsteb remix. Separate the words with a space.
# userEntry = input().split("WUB")
# original = ""
# for word in userEntry:
#     if word != "":
#         if original == "":
#             original = word
#         else:
#             original += " " + word
# print(original)
# ---------------------------------------------------------------------------------------------------------------------

# 9
# Multiply by 2, divide by 6
# https://codeforces.com/problemset/problem/1374/B
# Input
# The first line of the input contains one integer 𝑡(1≤𝑡≤2⋅104) — the number of test cases. Then 𝑡test cases follow.
# The only line of the test case contains one integer 𝑛(1≤𝑛≤109).
# Output
# For each test case, print the answer — the minimum number of moves needed to obtain 1 from 𝑛 if it's possible to do that or -1 if it's impossible to obtain 1 from 𝑛.

# times = int(input())
# answers = []
# for time in range(times):
#     currentNumber = int(input())
#     if currentNumber == 1:
#         answers.append(0)
#     else:
#         moves = 0
#         while currentNumber != 2:
#             if currentNumber / 6 == 1:
#                 moves += 1
#                 break
#             elif currentNumber % 3 != 0:
#                 moves = -1
#                 break
#             else:
#                 if currentNumber % 6 == 0:
#                     currentNumber = currentNumber / 6
#                 else:
#                     currentNumber = currentNumber * 2
#             moves += 1
#         if currentNumber == 2:
#             moves = -1
#         answers.append(moves)

# for i in range(len(answers)):
#     print(answers[i])
# ---------------------------------------------------------------------------------------------------------------------

# Game With Sticks
# https://codeforces.com/problemset/problem/451/A
# Input
# The first line of input contains two space-separated integers, n and m (1 ≤ n, m ≤ 100).
# Output
# Print a single line containing "Akshat" or "Malvika" (without the quotes), depending on the winner of the game.

# coordinates = list(map(int, input().split()))
# x = coordinates[0]
# y = coordinates[1]
# turn = 0
# while x != 0 and y != 0:
#     turn += 1
#     x -= 1
#     y -= 1

# if turn % 2 != 0:
#     print("Akshat")
# else:
#     print("Malvika")
# ---------------------------------------------------------------------------------------------------------------------

# Candies
# https://codeforces.com/problemset/problem/1343/A

# Function to check if x is power of 2
# def isPowerOfTwo(x):
#     return (x and (not(x & (x - 1))))


# times = int(input())
# answers = []
# for time in range(times):
#     number = int(input())
#     for i in range(1, number):
#         if number % i == 0:
#             x = i
#             y = number//i + 1
#             if isPowerOfTwo(y):
#                 answers.append(i)
#                 break
# for answer in answers:
# #     print(answer)

# number = int(input())
# suma = 3
# k = 2
# while number % suma:
#     print(k)
#     k <<= 1
#     suma += k
# print(number//suma)
# if number % i == 0:
#     x = i
#     y = number//i + 1
#     if isPowerOfTwo(y):
#         print(i)
#         break

# ---------------------------------------------------------------------------------------------------------------------

# Vasya and Socks
# https://codeforces.com/problemset/problem/460/A
# Input
# The single line contains two integers n and m (1 ≤ n ≤ 100; 2 ≤ m ≤ 100), separated by a space.
# Output
# Print a single integer — the answer to the problem.

# inputs = list(map(int, input().split(" ")))
# initialSocks = inputs[0]
# shopDay = inputs[1]
# # it has the intial with the obvious amount of socks it can have those days - we are missing the socks got in the other days
# totalDays = initialSocks
# prevCounter = 0
# while totalDays//shopDay != prevCounter:
#     if prevCounter == 0:
#         prevCounter = totalDays//shopDay
#         totalDays += prevCounter
#     else:
#         totalDays += 1
#         prevCounter += 1
# print(totalDays)
# ---------------------------------------------------------------------------------------------------------------------

# Ilya and Bank Account
# https://codeforces.com/problemset/problem/313/A
# Input
# The single line contains integer n (10 ≤ |n| ≤ 109) — the state of Ilya's bank account.
# Output
# In a single line print an integer — the maximum state of the bank account that Ilya can get.
# bankAccountBalance = int(input())
# bankAccountBalanceStr = str(bankAccountBalance)
# if bankAccountBalance < 0:
#     strLen = len(bankAccountBalanceStr) - 1
#     if bankAccountBalanceStr[strLen] > bankAccountBalanceStr[strLen - 1]:
#         bankAccountBalanceStr = bankAccountBalanceStr[:strLen]
#     else:
#         bankAccountBalanceStr = bankAccountBalanceStr[:strLen -
#                                                       1] + bankAccountBalanceStr[strLen:]
# print(int(bankAccountBalanceStr))
# ---------------------------------------------------------------------------------------------------------------------

# Construct the String
# https://codeforces.com/problemset/problem/1335/B

# times = int(input())
# answers = []
# chars = "abcdefghijklmnopqrstuvwxyz"
# for time in range(times):
#     inputList = list(map(int, input().split()))
#     n = inputList[0]  # length
#     a = inputList[1]  # substring
#     b = inputList[2]  # diferents
#     stringFinalized = ""
#     substring = chars[:b]
#     while len(stringFinalized) < n:
#         missingLetters = n - len(stringFinalized)
#         if missingLetters > b:
#             stringFinalized += substring
#         else:
#             stringFinalized += substring[:missingLetters]
#     answers.append(stringFinalized)
# for i in range(len(answers)):
#     print(answers[i])
# ---------------------------------------------------------------------------------------------------------------------

# Kana and Dragon Quest game
# https://codeforces.com/problemset/problem/1337/B

# times = int(input())
# answers = []
# for time in range(times):
#     inputList = list(map(int, input().split()))
#     life = inputList[0]
#     voidHits = inputList[1]
#     lightHits = inputList[2]

#     while life > 0:
#         if lightHits * 10 >= life:
#             # it would be dead
#             answers.append("YES")
#             break
#         if voidHits > 0:
#             life = life//2 + 10
#             voidHits -= 1
#         else:
#             answers.append("NO")
#             break
# for i in range(len(answers)):
#     print(answers[i])
# ---------------------------------------------------------------------------------------------------------------------

# Case of the Zeros and Ones
# https://codeforces.com/problemset/problem/556/A
# Input
# First line of the input contains a single integer n (1 ≤ n ≤ 2·105), the length of the string that Andreid has.
# The second line contains the string of length n consisting only from zeros and ones.
# Output
# Output the minimum length of the string that may remain after applying the described operations several times.

# lenght = int(input())
# strToevaluate = input()
# ceros = 0
# ones = 0
# for i in range(lenght):
#     if strToevaluate[i] == "1":
#         ones += 1
#     else:
#         ceros += 1
# print(abs(ceros-ones))
# ---------------------------------------------------------------------------------------------------------------------

# Keyboard
# https://codeforces.com/problemset/problem/474/A
# direction = input()
# strToCheck = input()
# keyboard = "qwertyuiopasdfghjkl;zxcvbnm,./"
# newStr = ""
# newPosition = -1
# if direction == "L":
#     newPosition = 1


# def find(c, str):
#     for i in range(len(str)):
#         if str[i] == c:
#             return i


# for i in range(len(strToCheck)):
#     newStr += keyboard[find(strToCheck[i], keyboard) + newPosition]
# print(newStr)
# ---------------------------------------------------------------------------------------------------------------------

times = int(input())
answers = []
for time in range(times):
    rombos = int(input())
    answers.append(rombos)
for i in range(len(answers)):
    print(answers[i])