#include <bits/stdc++.h>
using namespace std;
int ben[100010], a[100010], n;
void dfs(int pos, int sta) {
  if (pos > n) return;
  if ((sta == -1 && ben[pos] == -1) || (sta == 1 && ben[pos] == 1)) {
    printf("+");
    dfs(pos + 1, -1);
  } else {
    printf("-");
    dfs(pos + 1, 1);
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  if (n == 1) {
    printf("+\n");
    return 0;
  }
  ben[n] = 1, ben[n - 1] = -1;
  int cha = a[n] - a[n - 1];
  for (int i = n - 2; i >= 1; i--) {
    if (a[i] >= cha) {
      ben[i] = 1;
      cha = a[i] - cha;
    } else {
      ben[i] = -1;
      cha = cha - a[i];
    }
  }
  dfs(1, 1);
  printf("\n");
}
