#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1500000;
const long long maxn = 1000000 + 5;
int z[maxn];
typedef struct node {
  long long x;
  long long y;
  long long mark;
} Node;
vector<Node> v;
int main() {
  long long a = 0, b = 0, p = MAXN * MAXN;
  Node mid;
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%I64d%I64d", &mid.x, &mid.y);
    mid.mark = i;
    v.push_back(mid);
  }
  for (int i = 0; i < n; i++) {
    if (a >= 0 && b >= 0 && v[i].x <= 0 && v[i].y <= 0) {
      a += v[i].x;
      b += v[i].y;
      z[v[i].mark] = 1;
    } else if (a >= 0 && b >= 0 && v[i].x >= 0 && v[i].y >= 0) {
      a -= v[i].x;
      b -= v[i].y;
      z[v[i].mark] = -1;
    } else if (a <= 0 && b <= 0 && v[i].x <= 0 && v[i].y <= 0) {
      a -= v[i].x;
      b -= v[i].y;
      z[v[i].mark] = -1;
    } else if (a <= 0 && b <= 0 && v[i].x >= 0 && v[i].y >= 0) {
      a += v[i].x;
      b += v[i].y;
      z[v[i].mark] = 1;
    } else if ((a - v[i].x) * (a - v[i].x) + (b - v[i].y) * (b - v[i].y) <
               (a + v[i].x) * (a + v[i].x) + (b + v[i].y) * (b + v[i].y)) {
      a -= v[i].x;
      b -= v[i].y;
      z[v[i].mark] = -1;
    } else {
      a += v[i].x;
      b += v[i].y;
      z[v[i].mark] = 1;
    }
    if (i == n - 1) {
      if (a * a + b * b > p) {
        random_shuffle(v.begin(), v.end());
        i = 0;
        a = 0;
        b = 0;
        continue;
      }
    }
  }
  for (int i = 0; i < n; i++) {
    printf("%d ", z[i]);
  }
  return 0;
}
