Maximum Cells Covered in a 2×N Grid by a Snake

You are given several test cases. For each test case, you are provided with an integer N representing the number of columns of a 2×N grid. A snake can start from any cell in the grid and move to cover cells, but it cannot cover more cells than the grid physically contains.

Since the grid has 2 rows, the maximum number of cells that can be covered is simply 2×N (i.e. \(2\times N\)) for a grid with N columns.

Your task is to compute this maximum value for each test case.

inputFormat

The first line contains an integer T denoting the number of test cases. The next line contains T space-separated integers, each representing the number of columns N of a 2×N grid.

outputFormat

For each test case, print on a new line the maximum number of cells the snake can cover, which is 2×N.

## sample

2
3 5

6
10

</p>