#include <bits/stdc++.h>
using namespace std;
long long n, ans[200000];
double nowx, nowy, ansx, ansy;
double work(double x, double y) { return sqrt(x * x + y * y); }
struct node {
  double x, y;
  int id;
} a[200000];
int cmp(node a, node b) { return rand() % 2; }
int main() {
  srand(time(0));
  scanf("%lld", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lf%lf", &a[i].x, &a[i].y);
    a[i].id = i;
  }
  ansx = a[1].x, ansy = a[1].y;
  ans[1] = 1;
  for (int i = 2; i <= n; i++) {
    double d1 = work(ansx + a[i].x, ansy + a[i].y),
           d2 = work(ansx - a[i].x, ansy - a[i].y);
    if (d1 > d2) {
      ansx -= a[i].x, ansy -= a[i].y;
      ans[i] = -1;
    } else {
      ansx += a[i].x, ansy += a[i].y;
      ans[i] = 1;
    }
  }
  if (work(ansx, ansy) <= 1500000) {
    for (int i = 1; i <= n; i++) {
      printf("%lld ", ans[i]);
    }
    return 0;
  }
  ans[1] = -1;
  ansx = -a[1].x, ansy = -a[1].y;
  for (int i = 2; i <= n; i++) {
    double d1 = work(ansx + a[i].x, ansy + a[i].y),
           d2 = work(ansx - a[i].x, ansy - a[i].y);
    if (d1 > d2) {
      ansx -= a[i].x, ansy -= a[i].y;
      ans[i] = -1;
    } else {
      ansx += a[i].x, ansy += a[i].y;
      ans[i] = 1;
    }
  }
  if (work(ansx, ansy) <= 1500000) {
    for (int i = 1; i <= n; i++) {
      printf("%lld ", ans[i]);
    }
    return 0;
  }
  while (1) {
    random_shuffle(a + 1, a + 1 + n);
    ansx = a[1].x, ansy = a[1].y;
    ans[a[1].id] = 1;
    for (int i = 2; i <= n; i++) {
      double d1 = work(ansx + a[i].x, ansy + a[i].y),
             d2 = work(ansx - a[i].x, ansy - a[i].y);
      if (d1 > d2) {
        ansx -= a[i].x, ansy -= a[i].y;
        ans[a[i].id] = -1;
      } else {
        ansx += a[i].x, ansy += a[i].y;
        ans[a[i].id] = 1;
      }
    }
    if (work(ansx, ansy) <= 1500000) {
      for (int i = 1; i <= n; i++) {
        printf("%lld ", ans[i]);
      }
      return 0;
    }
    ans[a[1].id] = -1;
    ansx = -a[1].x, ansy = -a[1].y;
    for (int i = 2; i <= n; i++) {
      double d1 = work(ansx + a[i].x, ansy + a[i].y),
             d2 = work(ansx - a[i].x, ansy - a[i].y);
      if (d1 > d2) {
        ansx -= a[i].x, ansy -= a[i].y;
        ans[a[i].id] = -1;
      } else {
        ansx += a[i].x, ansy += a[i].y;
        ans[a[i].id] = 1;
      }
    }
    if (work(ansx, ansy) <= 1500000) {
      for (int i = 1; i <= n; i++) {
        printf("%lld ", ans[i]);
      }
      return 0;
    }
  }
  return 0;
}
