Sum

2000ms

262144K

Description:

Vasya has found a piece of paper with an array written on it. The array consists of n integers a₁, a₂, ..., a_n. Vasya noticed that the following condition holds for the array a_i ≤ a_i + 1 ≤ 2·a_i for any positive integer i (i < n).

Vasya wants to add either a "+" or a "-" before each number of array. Thus, Vasya will get an expression consisting of n summands. The value of the resulting expression is the sum of all its elements. The task is to add signs "+" and "-" before each number so that the value of expression s meets the limits 0 ≤ s ≤ a₁. Print a sequence of signs "+" and "-", satisfying the given limits. It is guaranteed that the solution for the problem exists.

Input:

The first line contains integer n (1 ≤ n ≤ 10⁵) — the size of the array. The second line contains space-separated integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁹) — the original array.

It is guaranteed that the condition a_i ≤ a_i + 1 ≤ 2·a_i fulfills for any positive integer i (i < n).

Output:

In a single line print the sequence of n characters "+" and "-", where the i-th character is the sign that is placed in front of number a_i. The value of the resulting expression s must fit into the limits 0 ≤ s ≤ a₁. If there are multiple solutions, you are allowed to print any of them.

Sample Input:

4
1 2 3 5

Sample Output:

+++-

Sample Input:

3
3 3 5

Sample Output:

++-

Informação

Provedor Codeforces

Código CF257D