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 JAVA):

Solution:
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.BigInteger;

public class FillDiamond
{	public static StringBuilder result;
	public static long[] dp;
	public static long[][] multiply(long matA[][],long[][] matB)
	{
		long[][] res=new long[2][2];
		res[0][0]=matA[0][0]*matB[0][0] +matA[0][1]*matB[1][0];
		res[0][1]=matA[0][0]*matB[0][1] +matA[0][1]*matB[1][1];
		res[1][0]=matA[1][0]*matB[0][0] +matA[1][1]*matB[1][0];
		res[1][1]=matA[1][0]*matB[0][1] +matA[1][1]*matB[1][1];
		return res;
	}
	public static long[][] power(int n)
	{
		long[][] base={{1,4*n-2},{0,0}};
		if(n==1)
			return base;
		long[][] res=power(n/2);
		res=multiply(res,res);
		if((n&1)==1)
			res=multiply(res,base);
		return res;
	}
	public static void solve() throws IOException
    {
		int n=ni();
		pln(n);
	}
	static AnotherReader sc;
    static PrintWriter out;
	public static void main (String[] args) throws java.lang.Exception
	{
		boolean oj = true;
        if(oj){sc=new AnotherReader();out=new PrintWriter(System.out);}
        else{sc=new AnotherReader(100);out=new PrintWriter("output.txt");}
        int t=1;
		result=new StringBuilder();
		t=ni();
		long s = System.currentTimeMillis();
        while(t-->0)
			solve();
		//pln(((System.currentTimeMillis() - s)/1000.0) + "s");
		out.flush();out.close();  
	}
	static void pln(Object o){out.println(o);}
    static void p(Object o){out.print(o);}
    static void pni(Object o){out.println(o);out.flush();}
    static int ni()throws IOException{return sc.nextInt();}
    static long nl()throws IOException{return sc.nextLong();}
    static double nd()throws IOException{return sc.nextDouble();}
    static String nln()throws IOException{return sc.nextLine();}
    static int[] nai(int N)throws IOException{int[]A=new int[N];for(int i=0;i!=N;i++){A[i]=ni();}return A;}
    static long[] nal(int N)throws IOException{long[]A=new long[N];for(int i=0;i!=N;i++){A[i]=nl();}return A;}
    static long gcd(long a, long b)throws IOException{return (b==0)?a:gcd(b,a%b);}
    static int gcd(int a, int b)throws IOException{return (b==0)?a:gcd(b,a%b);}
    static int bit(long n)throws IOException{return (n==0)?0:(1+bit(n&(n-1)));}
	static boolean isPowerOfTwo (int x) throws IOException{ return x!=0 && ((x&(x-1)) == 0);} //1000(8) & 1111(7)==0
	static boolean isPrime2(long n)throws IOException{ return BigInteger.valueOf(n).isProbablePrime(1);}
	static BigInteger factorial(long n) throws IOException{BigInteger res = BigInteger.ONE;for(long i=1;i<=n;i++)res = res.multiply(BigInteger.valueOf(i)); return res;}
	static boolean isPrime(long n){if(n<2)return false;if(n==2 || n==3)return true;for(int i=1;i*i<=n;i++){long a=6*i+1;long b=6*i-1;if(n%a==0 || n%b==0)return false;}return true;}
 
 
    static class AnotherReader{BufferedReader br; StringTokenizer st;AnotherReader()throws FileNotFoundException{br=new BufferedReader(new InputStreamReader(System.in));}AnotherReader(int a)throws FileNotFoundException{br = new BufferedReader(new FileReader("input.txt"));}String next()throws IOException{while (st == null || !st.hasMoreElements()) {try{st = new StringTokenizer(br.readLine());}catch (IOException  e){e.printStackTrace(); }}return st.nextToken();}int nextInt() throws IOException{return Integer.parseInt(next());}long nextLong() throws IOException{return Long.parseLong(next());}double nextDouble()throws IOException {return Double.parseDouble(next()); }String nextLine() throws IOException{ String str = "";try{str = br.readLine();}catch (IOException e){e.printStackTrace();} return str;}} 
/////////////////////////////////////////////////////////////////////////////////////////////////////////////
}