Filling Diamonds

You are given an integer $n$. Count the ways to completely cover a belt-like region of $4n-2$ triangles with diamond shapes.

A diamond is made of two triangles. You may move, rotate, or flip a diamond, but you may not scale it. Two coverings are different if there are two triangles that are covered by the same diamond in one covering but by different diamonds in the other.

See the pictures below. The diamond on the left is the shape you will use, and the region on the right is the one you need to fill.

The figures show the region for $n = 1, 2, 3, 4$.

Answer $t$ independent test cases.

The first line contains a single integer $t$ ($1 \le t \le 10^{4}$), the number of test cases.

Each of the next $t$ lines contains a single integer $n$ ($1 \le n \le 10^{9}$).

For each test case, print the number of ways to fully cover the belt-like region of $4n-2$ triangles with diamond shapes. Under the given constraints, this number does not exceed $10^{18}$.

In the first test case, there are 2 ways to fill the region.

In the second test case, there is only one way to fill the region.