Author:  A. Zhuplev, A. Klenin  Time limit:  1 sec  
Input file:  input.txt  Memory limit:  256 Mb  
Output file:  output.txt 
Recently, explorers have discovered a new species of giant sentient squids living at the bottom of a deep lake.
Squids are generally uninterested in dealing with humans. However, they showed appreciation for various jewels, especially diamonds, which are hard to find under water. In exchange, squids offered a wide selection of highquality pearls.
So the trade was established. Each day, N different kinds of jewels were traded, some from the surface into the water, and some out of the water to the surface.
The Squid State Trading Commission established following rules:
You program must find the volume of the container for each kind of jewel, so as to satisfy commission's requirements.
Input file contains an integer N followed by N integers a_{i}, where a_{i} > 0 means that a_{i} jewels of ith kind are moved from the surface to the lake, and a_{i} < 0 means that a_{i} jewels of ith kind are moved from the lake to the surface.
Output file must contain N integers b_{i} (1 ≤ b_{i} ≤ 10^{12}), indicating the volume of containers for each kind of jewel. If there are several acceptable solutions, output any of them.
2 ≤ N ≤ 10^{5}
1 ≤ a_{i} ≤ 10^{5}
2 × min(pos, neg) ≥ max(pos, neg), where pos is the number of positive values among a_{i} and neg is the number of negative values.
No.  Input file (input.txt ) 
Output file (output.txt ) 

1 


2 

