#include <bits/stdc++.h>
using namespace std;
long long re[100069], n, x[100069], y[100069], cx, cy;
long long dist(long long x, long long y) { return x * x + y * y; }
int main() {
  scanf("%lld", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld%lld", &x[i], &y[i]);
  }
  for (int i = n; i >= 1; i--) {
    if (dist(cx + x[i], cy + y[i]) <= dist(cx - x[i], cy - y[i])) {
      cx += x[i];
      cy += y[i];
      re[i] = 1;
    } else {
      cx -= x[i];
      cy -= y[i];
      re[i] = -1;
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", re[i]);
}
