Reminder: in case of any technical issues, you can use the lightweight website
m1.codeforces.com,
m2.codeforces.com,
m3.codeforces.com.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Sum

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputVasya 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.

Input

The first line contains integer *n* (1 ≤ *n* ≤ 10^{5}) — the size of the array. The second line contains space-separated integers *a*_{1}, *a*_{2}, ..., *a*_{n} (0 ≤ *a*_{i} ≤ 10^{9}) — 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*_{1}. If there are multiple solutions, you are allowed to print any of them.

Examples

Input

4

1 2 3 5

Output

+++-

Input

3

3 3 5

Output

++-

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/08/2020 17:40:06 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|