#include <bits/stdc++.h>
using namespace std;
int ans[1010101];
int n;
struct node {
  double a, b;
  int id;
} x[1010101];
signed main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x[i].a >> x[i].b;
    x[i].id = i;
  }
  while (1) {
    random_shuffle(x + 1, x + 1 + n);
    double X = x[1].a, Y = x[1].b;
    for (int i = 2; i <= n; i++) {
      if ((X + x[i].a) * (X + x[i].a) + (Y + x[i].b) * (Y + x[i].b) <
          (X - x[i].a) * (X - x[i].a) + (Y - x[i].b) * (Y - x[i].b)) {
        X += x[i].a;
        Y += x[i].b;
      } else {
        X -= x[i].a;
        Y -= x[i].b;
      }
    }
    if (X * X + Y * Y > pow(1.5e6, 2)) continue;
    X = x[1].a, Y = x[1].b;
    ans[x[1].id] = 1;
    for (int i = 2; i <= n; i++) {
      if ((X + x[i].a) * (X + x[i].a) + (Y + x[i].b) * (Y + x[i].b) <
          (X - x[i].a) * (X - x[i].a) + (Y - x[i].b) * (Y - x[i].b)) {
        ans[x[i].id] = 1;
        X += x[i].a;
        Y += x[i].b;
      } else {
        ans[x[i].id] = -1;
        X -= x[i].a;
        Y -= x[i].b;
      }
    }
    for (int i = 1; i <= n; i++) {
      printf(~ans[i] ? "1 " : "-1 ");
    }
    return 0;
  }
  return 0;
}
