#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<long long> ar(n);
  if (n == 1) {
    cout << '+' << endl;
    return 0;
  }
  if (n == 2) {
    cout << "-+" << endl;
    return 0;
  }
  for (int i = 0; i < n; i++) cin >> ar[i];
  deque<char> o;
  o.push_front('+');
  o.push_front('-');
  long long s = ar[n - 1] - ar[n - 2];
  vector<int> change(n);
  for (int i = 0; i < n; i++) change[i] = 0;
  for (int i = n - 3; i >= 0; i--) {
    if (s >= ar[i]) {
      s -= ar[i];
      o.push_front('-');
    } else {
      change[i] = -1;
      s *= -1;
      s = s + ar[i];
      o.push_front('+');
    }
  }
  int nchange = 0;
  for (int i = 0; i < n; i++) {
    if (nchange % 2) {
      if (o[i] == '+')
        cout << '-';
      else
        cout << '+';
      nchange += change[i];
    } else {
      cout << o[i];
      nchange += change[i];
    }
  }
  cout << endl;
  return 0;
}
