#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long maxn = 3e6;
const long long mod = 1e9 + 7;
const long double PI = acos((long double)-1);
long long pw(long long a, long long b, long long md = mod) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = (a * res) % md;
    }
    a = (a * a) % md;
    b >>= 1;
  }
  return (res);
}
int n;
long long a[maxn];
string s;
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  long long ne = 0, p = 0;
  for (int i = n; i; i--) {
    if (ne > p)
      p += a[i], s = "+" + s;
    else
      ne += a[i], s = "-" + s;
  }
  if (ne > p)
    for (int i = 0; i < n; i++) s[i] = ((s[i] == '+') ? '-' : '+');
  cout << s;
  return (0);
}
