#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
const int IT_MAX = 1 << 18;
const int MAXN = 1e5 + 5;
const int mod = 1e9 + 7;
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int n, x, y, r[MAXN];
pair<pair<int, int>, int> p[MAXN];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d %d", &x, &y);
    p[i] = make_pair(make_pair(x, y), i);
  }
  while (1) {
    random_shuffle(p, p + n);
    long long x = 0, y = 0;
    for (int i = 0; i < n; i++) {
      long long ux = x + p[i].first.first, uy = y + p[i].first.second;
      long long vx = x - p[i].first.first, vy = y - p[i].first.second;
      if (ux * ux + uy * uy < vx * vx + vy * vy) {
        r[p[i].second] = 1;
        x = ux, y = uy;
      } else {
        r[p[i].second] = -1;
        x = vx, y = vy;
      }
    }
    if (x * x + y * y < 1.5 * 1.5 * 1e12) {
      for (int i = 0; i < n; i++) printf("%d ", r[i]);
      return 0;
    }
  }
}
