#include <bits/stdc++.h>
using namespace std;
const int mod = 1000 * 1000 * 1000 + 7;
const int maxn = 100000 + 10;
const int inf = 1000000000;
ifstream fin("input.txt");
ofstream fout("output.txt");
long long n, a[maxn], s, p;
vector<char> v;
bool o;
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = n - 1; i >= 0; i--) {
    if (s <= p) {
      s += a[i];
      v.push_back('+');
    } else {
      p += a[i];
      v.push_back('-');
    }
  }
  reverse(v.begin(), v.end());
  if (s < p) o = 1;
  if (!o) {
    for (int i = 0; i < v.size(); i++) cout << v[i];
  } else
    for (int i = 0; i < v.size(); i++) {
      if (v[i] == '-')
        cout << '+';
      else
        cout << '-';
    }
  cout << endl;
  return 0;
}
