#include <bits/stdc++.h>
using namespace std;

const int MAXN(2e5 + 5);

int n;
int cnt[MAXN], tt[MAXN];

int main() {
	memset(tt, 0x3f, sizeof tt);
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		int x, c = 1;
		scanf("%d", &x);
		if (x < 0) x = -x, c = -1;

		for (int j = 31; j >= 0; j--) {
			cnt[i + j] += c * ((x >> j) & 1);
		}
		
		int s = i - 1;
		int tmp = 0;
		for (int j = s; j >= 1; j--) {
			tmp *= 2;
			if (abs(tmp) > n) break;
			if (j < s && tt[j] != 0x3f3f3f3f) {
				tmp += tt[j];
				break;
			} else tmp += cnt[j];
			if (abs(tmp) > n) break;
		}
		if (abs(tmp) <= n) tt[s] = tmp;
		else tt[s] = 0x3f3f3f3f;

		tmp = 0;
		for (int j = i + 31; j >= 1; j--) {
			tmp *= 2;
			if (abs(tmp) > n) break;
			if (j <= s && tt[j] != 0x3f3f3f3f) {
				tmp += tt[j];
				break;
			} else tmp += cnt[j];
			if (abs(tmp) > n) break;
		}

		if (tmp > 0) putchar('+');
		else if (tmp < 0) putchar('-');
		else putchar('0');
	}
	putchar('\n');
	return 0;
}