#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
template <typename T>
T pow(T a, T b, long long m) {
  T ans = 1;
  while (b > 0) {
    if (b % 2 == 1) ans = (ans * a) % m;
    b /= 2;
    a = (a * a) % m;
  }
  return ans % m;
}
const long long N = 1e6 + 5;
long long n;
long long a[N];
int32_t main() {
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  vector<char> ans;
  ans.push_back('+');
  long long cur = a[n];
  for (long long i = n - 1; i >= 1; i--) {
    if (cur > 0) {
      cur -= a[i];
      ans.push_back('-');
    } else {
      cur += a[i];
      ans.push_back('+');
    }
  }
  reverse(ans.begin(), ans.end());
  for (auto it : ans) {
    if (cur >= 0)
      cout << it;
    else
      cout << ((it == '+') ? '-' : '+');
  }
  return 0;
}
