#include <bits/stdc++.h>
using namespace std;
int n;
int x[100005];
int mark[100005];
int ans[100005];
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i];
  }
  memset(mark, 0, sizeof mark);
  ans[n - 1] = 1;
  ans[n - 2] = 0;
  int t = x[n - 1] - x[n - 2];
  for (int i = n - 2; i >= 1; i--) {
    t -= x[i - 1];
    if (t >= 0) {
      ans[i - 1] = 0;
    } else {
      t = abs(t);
      mark[i] = 1;
      ans[i - 1] = 1;
    }
  }
  int z = 1;
  for (int i = 0; i < n; i++) {
    z ^= mark[i];
    if (z) {
      if (ans[i] == 0) {
        cout << "-";
      } else {
        cout << "+";
      }
    } else {
      if (ans[i] == 0) {
        cout << "+";
      } else {
        cout << "-";
      }
    }
  }
  return 0;
}
