#include <bits/stdc++.h>
const int N = 100005;
using namespace std;
int n, a[N], b[N], flag[N];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = 1;
  int now = a[n];
  for (int i = n - 1; i >= 1; i--) {
    if (now > a[i])
      b[i] = -1, flag[i] = 1, now = now - a[i];
    else
      b[i] = 1, flag[i] = -1, now = a[i] - now;
  }
  int yh = 1;
  for (int i = 1; i <= n; i++) {
    if (b[i] * yh == 1)
      printf("+");
    else
      printf("-");
    yh *= flag[i];
  }
  return 0;
}
