#include <bits/stdc++.h>
using namespace std;
int gi() {
  int a;
  scanf("%d", &a);
  return a;
}
long long gli() {
  long long a;
  scanf("%I64d", &a);
  return a;
}
int x[200000];
int y[200000];
int w[200000];
int f[200000];
int c1[200000];
int c2[200000];
int L;
int mknd(int ww) {
  x[L] = gi();
  y[L] = gi();
  w[L] = ww;
  f[L] = 1;
  return L++;
}
int mkp(int n1, int n2, int m) {
  f[n2] = m;
  x[L] = x[n1] + m * x[n2];
  y[L] = y[n1] + m * y[n2];
  f[L] = 1;
  c1[L] = n1;
  c2[L] = n2;
  return L++;
}
void st(int a, int ff) {
  ff *= f[a];
  if (w[a] == -1) {
    st(c1[a], ff);
    st(c2[a], ff);
  } else
    x[w[a]] = ff;
}
int sm(long long x, long long y, long long c = 1000000LL) {
  return x * x + y * y <= c * c;
}
int main() {
  int n = gi();
  if (n == 1) {
    printf("1\n");
    return 0;
  }
  memset(w, -1, sizeof(w));
  L = 0;
  int n1 = mknd(0);
  int n2 = mknd(1);
  for (int i = 2; i < n; i++) {
    int n3 = mknd(i);
    if (sm(x[n1] + x[n2], y[n1] + y[n2])) {
      n1 = mkp(n1, n2, 1);
      n2 = n3;
    } else if (sm(x[n1] + x[n3], y[n1] + y[n3])) {
      n1 = mkp(n1, n3, 1);
    } else if (sm(x[n2] + x[n3], y[n2] + y[n3])) {
      n2 = mkp(n2, n3, 1);
    } else if (sm(x[n1] - x[n2], y[n1] - y[n2])) {
      n1 = mkp(n1, n2, -1);
      n2 = n3;
    } else if (sm(x[n1] - x[n3], y[n1] - y[n3])) {
      n1 = mkp(n1, n3, -1);
    } else {
      n2 = mkp(n2, n3, -1);
    }
  }
  st(mkp(n1, n2, sm(x[n1] + x[n2], y[n1] + y[n2], 1500000LL) ? 1 : -1), 1);
  for (int i = 0; i < n; i++) printf("%d%c", x[i], (i == n - 1 ? '\n' : ' '));
  return 0;
}
