#include <bits/stdc++.h>
using namespace std;
int n, vect[3][100010], ans[100010];
void print() {
  for (int i = 1; i <= n; i++) {
    printf("%d ", ans[i]);
  }
  exit(0);
}
void fs(double x, double y, int k) {
  if (sqrt(x * x + y * y) > 1500000.0) return;
  if (k == n + 1) {
    print();
  }
  double tx1 = x + vect[1][k], ty1 = y + vect[2][k], tx2 = x - vect[1][k],
         ty2 = y - vect[2][k];
  if (sqrt(tx1 * tx1 + ty1 * ty1) < sqrt(tx2 * tx2 + ty2 * ty2)) {
    ans[k] = 1;
    fs(tx1, ty1, k + 1);
    ans[k] = -1;
    fs(tx2, ty2, k + 1);
  } else {
    ans[k] = -1;
    fs(tx2, ty2, k + 1);
    ans[k] = 1;
    fs(tx1, ty1, k + 1);
  }
}
double x, y, tx, ty, t1, t2;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &vect[1][i], &vect[2][i]);
    tx = x + vect[1][i];
    ty = y + vect[2][i];
    t1 = sqrt(tx * tx + ty * ty);
    tx = x - vect[1][i];
    ty = y - vect[2][i];
    t2 = sqrt(tx * tx + ty * ty);
    if (t1 > t2) {
      x -= vect[1][i];
      y -= vect[2][i];
      ans[i] = -1;
    } else {
      x += vect[1][i];
      y += vect[2][i];
      ans[i] = 1;
    }
  }
  if (sqrt(x * x + y * y) < 1500000) {
    print();
  }
  fs(0.0, 0.0, 1);
  print();
}
