#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N], sign[N];
bool m;
int main() {
  int n, s;
  cin >> n;
  fill(sign, sign + N, 1);
  for (int i = 0; i < n; i++) cin >> a[i];
  s = a[n - 1];
  for (int i = n - 2; i >= 0; i--) {
    if (s - a[i] < 0) {
      s = -s;
      sign[i + 1] = -1;
    } else
      a[i] = -a[i];
    s += a[i];
  }
  for (int i = 0; i < n; i++)
    if (sign[i] == -1 && m == 0) {
      a[i] = -a[i];
      while (sign[++i] != -1 && i < n) a[i] = -a[i];
      m = 1;
      i--;
    } else if (sign[i] == -1 && m == 1)
      m = 0;
  for (int i = 0; i < n; i++)
    if (a[i] < 0)
      cout << "-";
    else
      cout << "+";
  return 0;
}
