# Special Sum

#######################################################################################################################
#
#   Special Sum of number N is defined as follows:
#
#   def foo(n):{
#       ret = 0
#       for i = 1 to n:
#       {
#        if gcd(n,i) is 1:
#                ret += 1
#       }
#       return ret
#   }
#
#   def SpecialSum(N):{
#       ret=0
#
#       for i = 1 to N:{
#             if i divides N:
#                ret += foo(i)
#        }
#        return ret
#   }
#
#   Given a N print SpecialSum(N).
#
#   Input:
#   First line contains T, the number of testcases.
#   Each testcase consists of one line containing N.
#
#   Output:
#   Print in one line for each testcase the required answer.
#
#   Constraints:
#   1 <= T <= 1000
#   1 <= N <= 10^10
#
#   SAMPLE INPUT
#   1
#   5
#
#   SAMPLE OUTPUT
#   5
#
#######################################################################################################################
