20250417

# def dfs(x,y):

# if x==0 and y==0:

# return a[0][0]

# elif x==1:

# return a[0][0]+a[1][y]

# elif y==0:

# b[x][0]=dfs(x-1,0)+a[x][0]

# elif y==len(a[x])-1:

# b[x][y]=dfs(x-1,y-1)+a[x][y]

# elif b[x][y]!=0:

# pass

# else:

# b[x][y]=max(dfs(x-1,y),dfs(x-1,y-1))+a[x][y]

# return b[x][y]

# n=int(input())

# a=[]

# b=[[0 for i in range(n)]for j in range(n)]

# s=int(0)

# for i in range(n):

# t=list(map(int,input().split()))

# a.append(t)

# for i in range(n):

# q=dfs(n-1,i)

# # print(q)

# if q>s:

# s=q

# print(s)

# def dfs(x):

# global n,a,b

# m=int(0)

# if x==n:

# return 0

# elif b[x]!=0:

# return b[x]

# for i in range(n-x):

# m=max(m,dfs(x+i+1)+a[i])

# b[x]=m

# return m

# n=int(input())

# a=list(map(int,input().split()))

# b=[0 for i in range(n)]

# s=int(0)

# print(dfs(0))

# import sys

# sys.setrecursionlimit(100000)

# def dfs(x,y):

# global n,m,a,b

# if x==0 and y==0:

# return a[x][y]

# elif b[x][y]!=-1:

# pass

# elif x==0:

# b[x][y]=dfs(x,y-1)+a[x][y]

# elif y==0:

# b[x][y]=dfs(x-1,y)+a[x][y]

# else:

# b[x][y]=max(dfs(x-1,y),dfs(x,y-1),dfs(x-1,y-1))+a[x][y]

# return b[x][y]

# n,m=map(int,input().split())

# a=[]

# b=[[-1 for i in range(m)]for j in range(n)]

# for i in range(n):

# t=list(map(int,input().split()))

# a.append(t)

# print(dfs(n-1,m-1))

n=int(input())

for i in range(n):

m=int(input())