#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int n;
int a[MAXN];
int c[MAXN];
void init() {
  if (scanf("%d", &n) == EOF) exit(0);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 1; i <= n; i++) c[i] = 0;
}
inline int lowbit(int x) { return x & (-x); }
int sum(int x) {
  int s = 0;
  for (int i = x; i > 0; i -= lowbit(i)) {
    s += c[i];
  }
  return s;
}
void add(int x) {
  for (int i = x; i <= n; i += lowbit(i)) {
    c[i] += 1;
  }
}
void flip(int x, int y) {
  add(x);
  add(y + 1);
}
void work() {
  int cur = a[n];
  for (int i = n - 1; i > 0; i--) {
    if (cur <= a[i]) {
      flip(i + 1, n);
      cur = a[i] - cur;
    } else {
      flip(i, i);
      cur = cur - a[i];
    }
  }
  for (int i = 1; i <= n; i++) {
    printf("%c", (sum(i) & 1) ? '-' : '+');
  }
  printf("\n");
}
int main() {
  while (true) {
    init();
    work();
  }
  return 0;
}
