#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
using std::random_shuffle;
using std::sort;
const long long N = 1e6 + 5;
long long n, ans;
long long x[N], y[N];
long long p[N], res[N], best[N];
long long ansx, ansy;
inline bool cmp(long long a, long long b) {
  return ((x[a]) * (x[a])) + ((y[a]) * (y[a])) >
         ((x[b]) * (x[b])) + ((y[b]) * (y[b]));
}
signed main() {
  long long T = 30;
  register long long i;
  scanf("%lld", &n);
  for (i = 1; i <= n; i++) scanf("%lld%lld", &x[i], &y[i]);
  for (i = 1; i <= n; i++) p[i] = i;
  sort(p + 1, p + n + 1, cmp);
  for (i = 1; i <= n; i++) {
    if (((ansx + x[p[i]]) * (ansx + x[p[i]])) +
            ((ansy + y[p[i]]) * (ansy + y[p[i]])) <
        ((ansx - x[p[i]]) * (ansx - x[p[i]])) +
            ((ansy - y[p[i]]) * (ansy - y[p[i]])))
      ansx += x[p[i]], ansy += y[p[i]], res[p[i]] = 1;
    else
      ansx -= x[p[i]], ansy -= y[p[i]], res[p[i]] = -1;
  }
  ans = ((ansx) * (ansx)) + ((ansy) * (ansy));
  memmove(best + 1, res + 1, sizeof(long long) * n);
  while (T--) {
    ansx = 0;
    ansy = 0;
    random_shuffle(p + 1, p + n + 1);
    for (i = 1; i <= n; i++) {
      if (((ansx + x[p[i]]) * (ansx + x[p[i]])) +
              ((ansy + y[p[i]]) * (ansy + y[p[i]])) <
          ((ansx - x[p[i]]) * (ansx - x[p[i]])) +
              ((ansy - y[p[i]]) * (ansy - y[p[i]])))
        ansx += x[p[i]], ansy += y[p[i]], res[p[i]] = 1;
      else
        ansx -= x[p[i]], ansy -= y[p[i]], res[p[i]] = -1;
    }
    if (((ansx) * (ansx)) + ((ansy) * (ansy)) < ans) {
      ans = ((ansx) * (ansx)) + ((ansy) * (ansy));
      memmove(best + 1, res + 1, sizeof(long long) * n);
    }
  }
  for (i = 1; i <= n; i++) printf("%lld ", best[i]);
  putchar('\n');
  return 0;
}
