#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 2e9;
const long long INF64 = 7e18;
const long double EPS = 1e-9;
const long double PI = 3.14159265358979310000;
const long long MD = 535355424;
const int TT = 1e5 * 3;
const int N = 200100;
const int M = 51;
int n, a[N], d[N], z[N];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  int sum = a[n];
  z[n] = 1;
  for (int i = n - 1; i >= 1; i--) {
    if (sum >= a[i]) {
      z[i] = 0;
      sum -= a[i];
    } else {
      d[i + 1]++;
      z[i] = 1;
      sum = a[i] - sum;
    }
  }
  int t = 0;
  for (int i = 1; i <= n; i++) {
    t += d[i];
    if ((z[i] + t) & 1)
      printf("+");
    else
      printf("-");
  }
  return 0;
}
