#include <bits/stdc++.h>
using namespace std;
int static const N = 200200;
long long n[4], gr[4][2][N], ind[4][N];
int znak[N];
int main() {
  int nn;
  scanf("%i", &nn);
  for (int i = 0; i < nn; i++) {
    long long a, b;
    scanf("%I64d%I64d", &a, &b);
    if (a >= 0) {
      if (b > 0) {
        ind[0][n[0]] = i;
        gr[0][0][n[0]] = a;
        gr[0][1][n[0]++] = b;
      } else {
        ind[3][n[3]] = i;
        gr[3][0][n[3]] = a;
        gr[3][1][n[3]++] = b;
      }
    } else {
      if (b > 0) {
        ind[1][n[1]] = i;
        gr[1][0][n[1]] = a;
        gr[1][1][n[1]++] = b;
      } else {
        ind[2][n[2]] = i;
        gr[2][0][n[2]] = a;
        gr[2][1][n[2]++] = b;
      }
    }
  }
  for (int i = 0; i < 4; i++) {
    if (n[i])
      znak[ind[i][0]] = 1;
    else
      continue;
    long long tx = gr[i][0][0], ty = gr[i][1][0];
    for (int j = 1; j < n[i]; j++) {
      long long zbx = tx + gr[i][0][j], zby = ty + gr[i][1][j];
      long long rzx = tx - gr[i][0][j], rzy = ty - gr[i][1][j];
      if (zbx * zbx + zby * zby <= rzx * rzx + rzy * rzy) {
        tx = zbx;
        ty = zby;
        znak[ind[i][j]] = 1;
      } else {
        tx = rzx;
        ty = rzy;
        znak[ind[i][j]] = -1;
      }
    }
    gr[i][0][0] = tx;
    gr[i][1][0] = ty;
  }
  int mn = 0;
  long long minnx = 0, minny = 0;
  for (int i = 0; i < 4; i++) {
    if (n[i]) {
      minnx -= gr[i][0][0];
      minny -= gr[i][1][0];
    }
  }
  for (int i = 1; i < 16; i++) {
    long long tx = 0, ty = 0;
    for (int j = 0; j < 4; j++) {
      if (n[j]) {
        long long s = -1;
        if ((i | (1 << j)) == i) s = 1;
        tx += s * gr[j][0][0];
        ty += s * gr[j][1][0];
      }
    }
    if (tx * tx + ty * ty < minnx * minnx + minny * minny) {
      minnx = tx;
      minny = ty;
      mn = i;
    }
  }
  for (int i = 0; i < 4; i++) {
    if (n[i] && (mn | (1 << i)) > mn) {
      for (int j = 0; j < n[i]; j++) znak[ind[i][j]] *= -1;
    }
  }
  for (int i = 0; i < nn; i++) printf("%i ", znak[i]);
  return 0;
}
