|Codeforces Round #666 (Div. 1)|
You are given an array $$$a$$$ of $$$n$$$ integers.
You want to make all elements of $$$a$$$ equal to zero by doing the following operation exactly three times:
It can be proven that it is always possible to make all elements of $$$a$$$ equal to zero.
The first line contains one integer $$$n$$$ ($$$1 \le n \le 100\,000$$$): the number of elements of the array.
The second line contains $$$n$$$ elements of an array $$$a$$$ separated by spaces: $$$a_1, a_2, \dots, a_n$$$ ($$$-10^9 \le a_i \le 10^9$$$).
The output should contain six lines representing three operations.
For each operation, print two lines:
4 1 3 2 4
1 1 -1 3 4 4 2 2 4 -3 -6 -6