# October 7 - BMTK Programming School, High League

# Distribution in Metagonia

There are one hundred noble families in the country of Metagonia, and each year some of these families receive several ritual cubes from the Seer of the One. The One has several rules about cube distribution: if a family receives at least one cube, every prime divisor of the number of cubes received should be either **2** or **3**, moreover if one family receives **a** > **0** cubes and another family in the same year receives **b** > **0** cubes then **a** should not be divisible by **b** and vice versa.

You are the Seer of the One. You know in advance how many cubes would be available for distribution for the next **t** years. You want to find any valid distribution of cubes for each of these years. Each year you have to distribute all cubes available for that year.

#### Input

The first line contains a single integer **t** (**1** ≤ **t** ≤ **1000**) - the number of years to come. Each of the following **t** lines contains a single integer `n`

(_{i}**1** ≤ `n`

≤ _{i}`10`

) - the number of cubes to distribute in ^{18}**i**-th year.

#### Output

For each year **i** output two lines. The first line should contain `m`

(_{i}**1** ≤ `m`

≤ _{i}**100**) - the number of families that would receive at least one cube in **i**-th year. The second line should contain `m`

integers - the number of cubes received by each family. The sum of these numbers should be equal to _{i}`n`

._{i}

4 1 2 3 10

1 1 1 2 1 3 2 4 6