B'An array of integers p_1, p_2, ... , p_n is called a permutation if it contains each number from 1 to n exactly once. For example, the following arrays are permutations: [3, 1, 2] , [1] , [1, 2, 3, 4, 5] and [4, 3, 1, 2] . The following arrays are not permutations: [2] , [1, 1] , [2, 3, 4] . Polycarp invented a really cool permutation p_1, p_2, ... , p_n of length n . It is very disappointing, but he forgot this permutation. He only remembers the array q_1, q_2, ... , q_{n-1} of length n-1 , where q_i=p_{i+1}-p_i . Given n and q=q_1, q_2, ... , q_{n-1} , help Polycarp restore the invented permutation. The first line contains the integer n ( 2 <= n <= 2 cdot10^5 ) -- the length of the permutation to restore. The second line contains n-1 integers q_1, q_2, ... , q_{n-1} ( -n < q_i < n ). Print the integer -1 if there is no such permutation of length n which corresponds to the given array q . Otherwise, if it exists, print p_1, p_2, ... , p_n . Print any such permutation if there are many of them. '...