#include <bits/stdc++.h>
using namespace std;
int n, a[100005], f[100005];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  int temp = 0;
  for (int i = n; i; i--)
    if (temp >= 0) {
      f[i] = 0;
      temp -= a[i];
    } else {
      f[i] = 1;
      temp += a[i];
    }
  bool d = temp < 0;
  for (int i = 1; i <= n; i++)
    if (f[i] == (1 ^ d))
      cout << "+";
    else
      cout << "-";
}
