#include <bits/stdc++.h>
using namespace std;
int x[100010], y[100010];
int ans[100010];
long long dst(long long x, long long y) { return x * x + y * y; }
int main() {
  int n;
  scanf("%d", &n);
  int px = 0, py = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &x[i], &y[i]);
    ans[i] = 1;
    px += x[i];
    py += y[i];
    if (dst(px, py) > dst(px - 2 * x[i], py - 2 * y[i])) {
      ans[i] = -1;
      px -= x[i] * 2;
      py -= y[i] * 2;
    }
  }
  if (dst(px, py) <= 2250000000000LL) {
    for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    if (dst(px - 2 * ans[i] * x[i], py - 2 * ans[i] * y[i]) <=
        2250000000000LL) {
      ans[i] *= -1;
      for (int j = 1; j <= n; j++) printf("%d ", ans[j]);
      return 0;
    }
  }
  return 0;
}
