#include <bits/stdc++.h>
#define int long long 
using namespace std;
#define For(i,a,b) for(int i = a; i <= b; ++i)
#define push_back emplace_back
#define mp make_pair
class us{
	private:
		vector<int> f;
	public:
		us(int n){
			f.resize(n + 1);
			For(i,1,n) 
				f[i] = i;
		}
		int gf(int x){
			if(x == f[x]) 
				return x;
			return f[x] = gf(f[x]);
		}
		void merge(int a,int b){
			a = gf(a);
			b = gf(b);
			f[b] = a;
		}
};
#define edg pair<int,pair<int,int>>
vector<int> tar,W;
vector<vector<pair<int,int> >> To;
vector<int> ans,siz;
int Dfs(int pos,int fa){
	int cur = 0;
	siz[pos] = tar[pos];
	int v = 0;
	for(auto son : To[pos]){
		if(son.first == fa) continue;
		v = Dfs(son.first,pos);
		siz[pos] += siz[son.first];
		if(v > cur){
			swap(cur,v);
		}
			ans.push_back(v);
	}
	if(fa != -1)
		cur += siz[pos] * (W[fa] - W[pos]);
	return cur;
}
#define eps (1e-10)
signed main(){
#ifdef NICEGUODONG
	freopen("data.in","r",stdin);
#endif
	ios::sync_with_stdio(false);
	int n;
	cin >> n;
	long double accm = 0;
	For(i,1,n){
		int a;
		cin >> a;
		accm = a + accm * 0.5;
		if(fabs(accm) <= eps){
			cout << "0";
		}
		else if(accm > 0){
			cout << "+";
		}
		else 
			cout << "-";
	}
}