#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
struct point {
  int x, y, z;
};
point a[maxn];
long long d(long long x, long long y);
int main() {
  int n;
  scanf("%d", &n);
  long long x = 0;
  long long y = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d %d", &a[i].x, &a[i].y);
  }
  for (int i = n - 1; i >= 0; --i) {
    if (d(x + a[i].x, y + a[i].y) <= d(x - a[i].x, y - a[i].y)) {
      a[i].z = 1;
      x += a[i].x;
      y += a[i].y;
    } else {
      a[i].z = -1;
      x -= a[i].x;
      y -= a[i].y;
    }
  }
  for (int i = 0; i < n; i++) {
    printf("%d ", a[i].z);
  }
  puts("");
  return 0;
}
long long d(long long x, long long y) { return x * x + y * y; }
