CF257D.Sum

Vasya has found a piece of paper with an array written on it. The array consists of n integers _a_1, _a_2, ..., 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_1. Print a sequence of signs "+" and "-", satisfying the given limits. It is guaranteed that the solution for the problem exists.

瓦西娅发现了一张写有数组的纸。该数组由 $n$ 个整数 $a_1,\,a_2,\,\dots,\,a_n$ 组成。瓦西娅注意到，该数组满足如下条件：对任意正整数 $i$（其中 $i < n$），均有 $a_i \le a_{i+1} \le 2\cdot a_i$。

瓦西娅希望在数组的每个数前添加一个 “+” 或 “−” 号。这样，他将得到一个由 $n$ 项组成的表达式。该表达式的值即为其所有项之和。任务是为每个数添加 “+” 或 “−” 号，使得表达式的值 $s$ 满足 $0 \le s \le a_1$。请输出一个满足上述限制的 “+” 和 “−” 号序列。题目保证该问题存在解。

The first line contains integer n (1 ≤ n ≤ 105) — the size of the array. The second line contains space-separated integers _a_1, _a_2, ..., a__n (0 ≤ a__i ≤ 109) — 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).

第一行包含一个整数 $n$（$1 \leq n \leq 10^5$）—— 数组的大小。
第二行包含 $n$ 个用空格分隔的整数 $a_1, a_2, \dots, a_n$（$0 \leq a_i \leq 10^9$）—— 原始数组。

保证对任意正整数 $i$（$i < n$），均满足条件 $a_i \leq a_{i+1} \leq 2 \cdot a_i$。

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_1. If there are multiple solutions, you are allowed to print any of them.

在一行中输出由 n 个字符 "+" 和 "-" 组成的序列，其中第 i 个字符是放在数字 a__i 前面的符号。最终表达式 s 的值必须满足 0 ≤ s ≤ _a_1。若存在多个解，输出任意一个即可。