#include <bits/stdc++.h>
using namespace std;
const double esp = 1e-6;
const int MAXN = 1e5 + 5;
const long long LIMIT = 2250000000000;
struct Vector {
  long long x, y;
  int ind;
  Vector(long long _x = 0, long long _y = 0) { x = _x, y = _y; }
  void Input(int ti) {
    scanf("%lld %lld", &x, &y);
    ind = ti;
  }
  void Output() { printf("%lld %lld\n", x, y); }
  long long distance() { return x * x + y * y; }
};
Vector operator+(Vector A, Vector B) { return Vector(A.x + B.x, A.y + B.y); }
Vector operator-(Vector A, Vector B) { return Vector(A.x - B.x, A.y - B.y); }
int ans[MAXN];
Vector inp[MAXN];
int main() {
  int n;
  scanf("%d", &n);
  Vector now;
  Vector t1, t2;
  for (int i = 0; i < n; i++) inp[i].Input(i);
  while (1) {
    now = Vector(0, 0);
    for (int i = 0; i < n; i++) {
      t1 = now + inp[i];
      t2 = now - inp[i];
      if (t1.distance() < t2.distance()) {
        ans[inp[i].ind] = 1;
        now = t1;
      } else {
        ans[inp[i].ind] = -1;
        now = t2;
      }
    }
    if (now.distance() <= LIMIT) break;
    random_shuffle(inp, inp + n);
  }
  for (int i = 0; i < n; i++) printf("%d ", ans[i]);
  puts("");
  return 0;
}
