#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; }
const int N = 101000;
int n, x, y, way[N];
pair<pair<int, int>, int> p1[N];
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &x, &y);
    p1[i] = make_pair(make_pair(x, y), i);
  }
  while (1) {
    random_shuffle(p1, p1 + n);
    long long x = 0, y = 0;
    for (int i = 0; i < n; i++) {
      long long ux = x + p1[i].first.first, uy = y + p1[i].first.second;
      long long vx = x - p1[i].first.first, vy = y - p1[i].first.second;
      if (ux * ux + uy * uy < vx * vx + vy * vy) {
        way[p1[i].second] = 1;
        x = ux;
        y = uy;
      } else {
        way[p1[i].second] = -1;
        x = vx;
        y = vy;
      }
    }
    if (x * x + y * y <= 2250000000000ll) {
      for (int i = 0; i < n; i++) printf("%d ", way[i]);
      puts("");
      return 0;
    }
  }
}
