#include <bits/stdc++.h>
using namespace std;
int n;
struct node {
  int x, y, id;
  void scan(int id) {
    this->id = id;
    scanf("%d%d", &x, &y);
  }
} a[100010];
int ans[100010];
long long dis(long long x1, long long y1, long long x2, long long y2) {
  return (x1 + x2) * (x1 + x2) + (y1 + y2) * (y1 + y2);
}
int main() {
  srand(time(NULL));
  while (scanf("%d", &n) != EOF) {
    for (int i = 1; i <= n; ++i) a[i].scan(i);
    while (1) {
      random_shuffle(a + 1, a + 1 + n);
      long long x = 0, y = 0;
      for (int i = 1; i <= n; ++i) {
        if (dis(x, y, a[i].x, a[i].y) <= dis(x, y, -a[i].x, -a[i].y)) {
          x += a[i].x;
          y += a[i].y;
          ans[a[i].id] = 1;
        } else {
          x -= a[i].x;
          y -= a[i].y;
          ans[a[i].id] = -1;
        }
      }
      if (dis(0, 0, x, y) <= 225ll * 10000000000) break;
    }
    for (int i = 1; i <= n; ++i) printf("%d%c", ans[i], " \n"[i == n]);
  }
  return 0;
}
