Nick and Array

给定一个长为 $n$ 的数组 $\{a_i\}$。 可以进行任意次操作，每次选择一个 $a_i$，并将其替换为 $-a_i-1$。 要使得修改后的数组中所有数的乘积最大，问修改后的数组是什么？

Nick had received an awesome array of integers $ a=[a_1, a_2, \dots, a_n] $ as a gift for his $ 5 $ birthday from his mother. He was already going to explore its various properties but after unpacking he was disappointed a lot because the product $ a_1 \cdot a_2 \cdot \dots a_n $ of its elements seemed to him not large enough. He was ready to throw out the array, but his mother reassured him. She told him, that array would not be spoiled after the following operation: choose any index $ i $ ( $ 1 \le i \le n $ ) and do $ a_i := -a_i - 1 $ . For example, he can change array $ [3, -1, -4, 1] $ to an array $ [-4, -1, 3, 1] $ after applying this operation to elements with indices $ i=1 $ and $ i=3 $ . Kolya had immediately understood that sometimes it's possible to increase the product of integers of the array a lot. Now he has decided that he wants to get an array with the maximal possible product of integers using only this operation with its elements (possibly zero, one or more times, as many as he wants), it is not forbidden to do this operation several times for the same index. Help Kolya and print the array with the maximal possible product of elements $ a_1 \cdot a_2 \cdot \dots a_n $ which can be received using only this operation in some order. If there are multiple answers, print any of them.

The first line contains integer $ n $ ( $ 1 \leq n \leq 10^{5} $ ) — number of integers in the array. The second line contains $ n $ integers $ a_1, a_2, \ldots, a_n $ ( $ -10^{6} \leq a_i \leq 10^{6} $ ) — elements of the array

Print $ n $ numbers — elements of the array with the maximal possible product of elements which can be received using only this operation in some order from the given array. If there are multiple answers, print any of them.

4
2 2 2 2

-3 -3 -3 -3 

1
0

0 

3
-3 -3 2

-3 -3 2