#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
    
const int MOD = 1e9 + 7;
const int MAXN = 2e5 + 5;
const ll INF = 1e14;

const int BSIZE = 1;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int n;
    cin >> n;

    vector<ll> v(n);

    for(ll & i :v)
        cin >> i;
    
    vector<ll> resp(n), resto(n);

    auto score_back =[&](int id) -> ll {
        ll sum = 0;
        for(int i = id; i >=max(0,id-BSIZE+1); i--){
            sum*=2;
            sum+=v[i];
        }
        return sum;
    };

    auto normalize =[&](ll x){
        if(x < 0)
            return -1;
        if(x > 0)
            return 1;
        if(x == 0)
            return 0;
    };

    auto print_score =[&](int id){
        ll x = resp[id]+resto[id];
        if(x < 0)
            cout << '-';
        if(x > 0)
            cout << '+';
        if(x == 0)
            cout << 0;
    };

    for(int i = 0; i < n; i++){
        resp[i] = score_back(i);
        if(i < BSIZE){
            print_score(i);
        } else {
            resp[i]+=resp[i-BSIZE]>>BSIZE;
            resto[i] = resto[i-BSIZE];
            if(resto[i-BSIZE] != normalize(resp[i])){
                resp[i]+=resto[i];
                resto[i]*=-1;
            }
            print_score(i);

        }
        if(resp[i] % (1ll<<BSIZE)){
            resto[i] = normalize(resp[i]);
        }
        // cerr << "(" 
    }
    for(int i = 0; i < n; i++)
        cerr << resp[i] << ' ' << resto[i] << '\n';

    return 0;
}