#include<bits/stdc++.h>
#define ll long long
#define pii make_pair
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,b,a) for(int i=b;i>=a;--i)
const ll inf = 1145141919810;
using namespace std;
inline ll read() {
	ll x=0,f=1;
	char c=getchar();
	while (c<'0' || c>'9') {
		if (c=='-')  f=-1;
		c=getchar();
	}
	while (c>='0' && c<='9') {
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}
inline void print(ll x) {
	if(x < 0) putchar('-'), x = -x;
	if(x > 9) print(x / 10);
	putchar(x % 10 + '0');
	return ;
}
inline void pprint(ll x) {
	print(x);
	puts("");
}
const int N = 2e5 + 7;
ll a[N], b[100], n;
ll qm(ll a, ll b) {
	ll base = 1;
	while(b) {
		if(b & 1) base *= a;
		a *= a;
		b >>= 1;
	}
	return base;
}
const int Block = 31;
void slv1() {
	vector<ll> f;
	f.resize(n + 1, 0ll);
	for(int i = 1; i <= n; ++i) {
		f[i] = f[i - 1] + a[i] * b[i - 1];
		if(f[i] > 0) {
			putchar('+');
		} else if(f[i] == 0) {
			putchar('0');
		} else if(f[i] < 0) {
			putchar('-');
		}
	}
}
void slv2() { //Block
	vector<ll> f;
	vector<int> g;
	f.resize(n + 1);
	g.resize(n + 1);
	for(int i = 1; i <= Block; ++i) {
		f[i] = f[i - 1] + a[i] * b[i - 1];
		if(f[i] > 0) {
			putchar('+');
		} else if(f[i] == 0) {
			putchar('0');
		} else if(f[i] < 0) {
			putchar('-');
		}
		if(f[i] > 0) g[i] = 1;
		if(f[i] == 0) g[i] = 0;
		if(f[i] < 0) g[i] = -1;
		
	}
	for(int i = Block + 1; i <= n; ++i){
		f[i - Block] = 0ll;
		for(int j = i - Block + 1, k = 0; j <= i; ++j, ++k){//计算连续的31个
			f[j] = f[j - 1] + a[j] * b[k];
		}
		
		if(f[i] > 0){
			putchar('+');
		}else if(f[i] == 0){
			if(g[i - Block] > 0){
				putchar('+');
			}else if(g[i - Block] == 0){
				putchar('0');
			}else if(g[i - Block] < 0){
				putchar('-');
			}
		}else if(f[i] < 0){
			putchar('-');
		}
		
		if(f[i] > 0) g[i] = 1;
		if(f[i] == 0) g[i] = 0;
		if(f[i] < 0) g[i] = -1;
	}
}
int main() {
	n = read();
	rep(i, 1, n) a[i] = read();
	for(int i = 0; i <= Block; ++i) b[i] = qm(2, i);
	if(n <= Block) {
		slv1();
	} else {
		slv2();
	}
	return 0;
}

/*
 10
 2 -1 4 -7 4 -8 3 -6 4 -7
*/