#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000;
const long long p = 1500000;
long long X, Y, P;
int ans[maxn];
struct in {
  long long x, y, id;
} s[maxn];
int main() {
  int N, i, j;
  P = p * p;
  scanf("%d", &N);
  for (i = 1; i <= N; i++) {
    scanf("%I64d%I64d", &s[i].x, &s[i].y);
    s[i].id = i;
  }
  while (true) {
    random_shuffle(s + 1, s + N + 1);
    X = Y = 0;
    for (i = 1; i <= N; i++) {
      if ((X + s[i].x) * (X + s[i].x) + (Y + s[i].y) * (Y + s[i].y) >
          (X - s[i].x) * (X - s[i].x) + (Y - s[i].y) * (Y - s[i].y))
        X -= s[i].x, Y -= s[i].y, ans[s[i].id] = -1;
      else
        X += s[i].x, Y += s[i].y, ans[s[i].id] = 1;
    }
    if (X * X + Y * Y <= P) {
      for (i = 1; i <= N; i++) printf("%d ", ans[i]);
      return 0;
    }
  }
  return 0;
}
