#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 P = 998244353;
const i64 inf = 1ll << 62;
void solve() {
    int n;
    cin >> n;
    vector<i64> a(n + 1), ans(n + 1);
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) {
        i64 res = a[i] << 32;
        for (int j = 1; j <= 32; j++) {
            if (ans[i - j] == 0 || res >= inf) break;
            res += a[i - j] << (32 - j);
        }
        if (res < 0) ans[i] = -1;
        else if (res == 0) ans[i] = 0;
        else ans[i] = 1;
    }
    for (int i = 1; i <= n; i++) {
        if (ans[i] < 0) cout << '-';
        else if (ans[i] == 0) cout << '0';
        else cout << '+';
    }
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
    int t = 1; 
    // cin >> t;
    while(t--) solve();
    return 0;
}