#include <bits/stdc++.h>
using namespace std;
const double PI = 2.0 * acos(0.0);
const double EPS = 1e-6;
int a[100005];
bitset<100005> sign;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", a + i);
  long long sum = 0LL;
  for (int i = n - 1; i >= 0; i--) {
    if (abs(sum - a[i]) < abs(sum + a[i])) {
      sum -= a[i];
      sign[i] = true;
    } else {
      sum += a[i];
    }
  }
  for (int i = 0; i < n; i++) printf("%c", sign[i] ^ (sum > 0) ? '+' : '-');
  puts("");
  return 0;
}
