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.io.*;  

public class Illegal {
    // public static String all = "";
    // public static void recur(int m,int s){
    //   if(s < 10 && m == 1){
    //   }
    // }
    // public String toString() {
    //     String var1 = this.getDescription() + "\n";
    //     List var2 = Arrays.asList(this.options);
    //     var2.set(3, this.getAnswer());
    //     Collections.shuffle(var2);
    //     int var3 = 1;

    //     String var5;
    //     for(Iterator var4 = var2.iterator(); var4.hasNext(); var1 = var1 + this.labels.get(var3 - 1) + ") " + var5 + (var3++ < 4 ? "\n" : "")) {
    //         var5 = (String)var4.next();
    //     }

    //     return var1;
    // }
  static int count = 0;


	  public static void main(String[] args) throws Exception {
      Scanner scan = new Scanner(System.in);
      int n,k;
      n = scan.nextInt();
      int[] arr = new int[n];
      for (int x = 0;x < n;x++) {
        arr[x] = scan.nextInt();
      }
      for (int x = 0;x < n;x++) {
        System.out.println(arr[x]);
      }
    }


    //   int a, b, size = 15;
    // for (a = size / 2; a <= size; a = a + 2) {
    // for (b = 1; b < size - a; b = b + 2)
    //     System.out.print(" "); 
    // for (b = 1; b <= a; b++)
    //     System.out.print("*"); 
    // for (b = 1; b <= size - a; b++)
    //     System.out.print(" ");  
    // for (b = 1; b <= a - 1; b++)
    //     System.out.print("*");
    // System.out.print("\n");
    // }
    // for (a = size; a >= 0; a--) {
    // for (b = a; b < size; b++)
    //     System.out.print(" ");
    // for (b = 1; b <= ((a * 2) - 1); b++)
    //     System.out.print("*");
    // System.out.print("\n");
    // }
    // HashSet<String> name=  new HashSet<>();
    // HashSet<String> surname=  new HashSet<>();
    // File file = 
    //   new File("./names.txt"); 
    // Scanner sc = new Scanner(file); 
    // while (sc.hasNextLine()) {
    //   String s = sc.nextLine();
    //   String[] split = s.split("\t");
      
    // }
    // System.out.println(name.size());
    // System.out.println(surname.size());
    // } 
    

		// int n;
  //       int[] p = new int[201];
  //       int m, k;
  //       int cnt = 0;
 
  //       int[][][] dp = new int[201][201][2];
  //       Scanner cin = new Scanner(System.in);
  //       n = cin.nextInt();
  //       m = n / 2;
  //       k = (n + 1) / 2;
  //       for(int i = 1; i <= n; i++){
  //           p[i] = cin.nextInt();
  //           if(p[i] > 0 && p[i] % 2 == 0) m --;
  //           if(p[i] % 2 != 0) k --;
  //       }
  //       for(int i = 0; i <= m; i++){
  //           dp[1][i][0] = INF;
  //           dp[1][i][1] = INF;
  //       }
  //       if(p[1] == 0){
  //           cnt = 1;
  //           dp[1][1][0] = 0;
  //           dp[1][0][1] = 0;
  //       }
  //       else{
  //           dp[1][0][p[1]%2] = 0;
  //       }
  //       for (int x = 0 ;x < dp.length;x++) {
  //         for (int y = 0;y < dp[x].length;y++) {
  //           for (int z = 0;z < dp[x][y].length;z++) {
  //             System.out.print(dp[x][y][z]);
  //           }
  //           System.out.println();
  //         }
  //         System.out.println();
  //       }
  //       for(int i = 2; i <= n; i++){
  //           if(p[i] != 0){
  //               for(int j = 0; j <= m; j++){
  //                   dp[i][j][0] = dp[i][j][1] = INF;
  //                   dp[i][j][p[i]%2] = Math.min(dp[i - 1][j][p[i]%2], dp[i - 1][j][1 - (p[i]%2)] + 1);
  //               }
  //           } else{
  //               cnt ++;
  //               dp[i][0][0] = INF;
  //               dp[i][0][1] = INF;
  //               if(cnt <= k)
  //                   dp[i][0][1] = Math.min(dp[i - 1][0][1], dp[i - 1][0][0] + 1);
  //               for(int j = 1; j <= m; j++){
  //                   dp[i][j][0] = dp[i][j][1] = INF;
  //                   if(j <= cnt)
  //                       dp[i][j][0] = Math.min(dp[i - 1][j - 1][0], dp[i - 1][j - 1][1] + 1);
  //                   if(j <= cnt && cnt - j <= k)
  //                       dp[i][j][1] = Math.min(dp[i - 1][j][0] + 1, dp[i - 1][j][1]);
  //               }
  //           }
  //       }
 
  //       System.out.print(Math.min(dp[n][m][0], dp[n][m][1]));
		
	
}