CF1339A.Filling Diamonds

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.

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.

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.

你有一个整数 $n$。请计算有多少种方法可以使用菱形图案完全覆盖一个由 $4n-2$ 个三角形构成的带状区域。

每个菱形图案由两个三角形组成。你可以对菱形进行平移、旋转或翻转，但不能缩放。

如果在两种覆盖方案中，存在某两个三角形：在其中一种方案中被同一个菱形覆盖，而在另一种方案中被不同的菱形覆盖，则认为这两种覆盖方案不同。

请参考下方图片以帮助理解。

左侧为你将使用的菱形图案，右侧为待填充的区域。

这些是 $n = 1, 2, 3, 4$ 时待填充区域的示意图。

你需要回答 $t$ 个相互独立的测试用例。

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}$).

第一行包含一个整数 $t$（$1 \le t \le 10^{4}$）—— 表示测试用例的数量。

接下来的 $t$ 行中，每行包含一个整数 $n$（$1 \le n \le 10^{9}$）。

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}$.

对于每个测试用例，输出使用菱形完全覆盖 $4n-2$ 个三角形组成的带状区域的方法数。在给定约束下可以证明，该方法数不超过 $10^{18}$。

In the first test case, there are the following $2$ ways to fill the area:

In the second test case, there is a unique way to fill the area:

在第一个测试用例中，填充该区域共有以下 $2$ 种方式：

在第二个测试用例中，填充该区域有唯一一种方式：