#include <iostream>
#include <algorithm>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <random>
using namespace std;
const int MN=101;
typedef long long ll;
typedef pair<int,int> P;
P ps[MN];
int vs[MN];
const int MS = 100*1000;
const int MS2 = MS/2;
ll dp[MN][MS];
bool res[MN];
bool rres[MN];
int n;
bool cur[MN];
std::mt19937 rng(666);
double rnd() {
return rng() / (double)rng.max();
}
ll better(ll a, ll b) {
return llabs(a) < llabs(b) ? a : b;
}
int scount;
ll ssum;
void solveSmall(ll bsum) {
if (llabs(bsum) > ssum) {
for(int i=0; i<scount; ++i) {
res[i] = bsum<0;
}
return;
}
int x=scount;
int sum=bsum;
while(x>0) {
int v=vs[x-1];
ll a = dp[x-1][sum+v + MS2];
// ll b = dp[x-1][sum-v + MS2];
// if (better(a,b) == a) {
if (a == dp[x][sum + MS2]) {
res[x-1] = 1;
sum += v;
} else {
res[x-1] = 0;
sum -= v;
}
--x;
}
}
ll smallRes(ll bsum) {
if (llabs(bsum) > ssum) {
return llabs(bsum) - ssum;
}
return llabs(dp[scount][MS2+bsum]);
}
ll ival2(ll r, P p) {
int i=p.first;
int j=p.second;
int sign = cur[i] ? -2 : 2;
int sign2 = cur[j] ? -2 : 2;
return r + sign * vs[i] + sign2 * vs[j];
}
ll ival(ll r, int i) {
int sign = cur[i] ? -2 : 2;
return r + sign * vs[i];
}
P improve2(ll r) {
P best=P(-1,-1);
ll bv=r;
for(int i=0; i<n; ++i) {
for(int j=i+1; j<n; ++j) {
P p(i,j);
ll rr = ival2(r, p);
if (llabs(rr) < llabs(bv)) {
best = P(i,j);
bv = rr;
}
}
}
return best;
}
int improve1(ll r) {
int best=-1;
ll bv=r;
for(int i=0; i<n; ++i) {
ll rr = ival(r, i);
if (llabs(rr) < llabs(bv)) {
best = i;
bv = rr;
}
}
return best;
}
void sa() {
ll r=0;
for(int i=scount; i<n; ++i) {
cur[i] = rng()&1;
r += (2*cur[i]-1)*vs[i];
}
ll best = smallRes(r);
memcpy(res, cur, sizeof(res));
// solveSmall(r);
int iters=0;
for(double t=20; t>0.001; t*=0.9999997) {
++iters;
int x = rng()%n;
int sign = cur[x] ? -2 : 2;
ll rr = r + sign * vs[x];
ll srr = smallRes(rr);
// if (srr < smallRes(r) || t>rnd()) {
if (true) {
cur[x] ^= 1;
r = rr;
if (srr < best) {
best = srr;
memcpy(res,cur,sizeof(res));
// solveSmall(rr);
}
}
}
cerr<<"iters "<<iters<<'\n';
cerr<<"best "<<best<<'\n';
}
ll bval=1e15;
void lol() {
ll r=0;
for(int i=0; i<n; ++i) {
// cur[i] = rng()&1;
cur[i] = res[i];
r += (2*cur[i]-1)*vs[i];
}
// ll best = llabs(r);
// memcpy(res, cur, sizeof(res));
while(1) {
ll x = improve1(r);
P y = improve2(r);
ll a = ival(r, x);
ll b = ival2(r, y);
if (llabs(a) >= llabs(r) && llabs(b) >= llabs(r)) break;
if (llabs(a) < llabs(b)) {
cur[x] ^= 1;
} else {
cur[y.first] ^= 1;
cur[y.second] ^= 1;
}
}
if (llabs(r) < llabs(bval)) {
memcpy(res, cur, sizeof(res));
bval = r;
}
}
int main() {
cin>>n;
for(int i=0; i<n; ++i) {
int x;
cin>>x;
ps[i]=P(x,i);
}
sort(ps,ps+n);
for(int i=0; i<n; ++i) vs[i]=ps[i].first;
ll sum=0;
for(int i=0; i<n; ++i) {
sum+=vs[i];
if (sum < MS2) {
ssum = sum;
scount = i+1;
}
}
cerr<<"scount "<<scount<<'\n';
scount=ssum=0;
for(int i=0; i<MS; ++i) {
dp[0][i] = i-MS2;
}
for(int i=1; i<=scount; ++i) {
int v = vs[i-1];
for(int j=0; j<MS; ++j) {
if (j>v && j+v<MS) {
dp[i][j] = better(dp[i-1][j-v], dp[i-1][j+v]);
} else {
dp[i][j] = 1e15;
}
// if (llabs(dp[i][j]) < ssum) cout<<"dp "<<i<<' '<<j<<" = "<<dp[i][j]<<'\n';
}
}
// cout<<dp[scount][MS2]<<'\n';
// assert(sum<MS2);
if (scount == n) {
solveSmall(0);
} else if (1) {
sa();
lol();
} else {
for(int i=0; i<1000; ++i) {
lol();
}
cerr<<"res "<<bval<<'\n';
}
for(int i=0; i<n; ++i) rres[ps[i].second] = res[i];
for(int i=0; i<n; ++i) cout<<1+rres[i]<<' ';cout<<'\n';
}
