#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  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; }
struct Z {
  long long x, y;
  int idx;
  int f;
};
bool operator<(Z a, Z b) { return a.idx < b.idx; }
vector<Z> a;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int tmp1, tmp2;
    scanf("%d%d", &tmp1, &tmp2);
    a.push_back((Z){tmp1 * 1ll, tmp2 * 1ll, i, 1});
  }
  while (1) {
    random_shuffle(a.begin(), a.end());
    long long nowx = 0, nowy = 0;
    for (int i = 0; i < n; i++) {
      if (((nowx + a[i].x) * (nowx + a[i].x) +
           (nowy + a[i].y) * (nowy + a[i].y)) <
          ((nowx - a[i].x) * (nowx - a[i].x) +
           (nowy - a[i].y) * (nowy - a[i].y))) {
        a[i].f = 1;
        nowx += a[i].x;
        nowy += a[i].y;
      } else {
        a[i].f = -1;
        nowx -= a[i].x;
        nowy -= a[i].y;
      }
    }
    if (nowx * nowx + nowy * nowy <= 2250000000000ll) {
      sort(a.begin(), a.end());
      for (int kk = 0; kk < n; kk++) cout << a[kk].f << " ";
      return 0;
    }
  }
  return 0;
}
