#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[100002];
int c[100002];
long long int dis(long long int x, long long int y) {
  return (sqrt(x * x + y * y));
}
int main() {
  int n;
  int x = 0, y = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d %d", &a[i].first, &a[i].second);
  }
  for (int i = n - 1; i >= 0; i--) {
    if (dis(x + a[i].first, y + a[i].second) <=
        dis(x - a[i].first, y - a[i].second)) {
      x += a[i].first;
      y += a[i].second;
      c[i] = 1;
    } else {
      x -= a[i].first;
      y -= a[i].second;
      c[i] = -1;
    }
  }
  for (int i = 0; i < n; i++) {
    printf("%d ", c[i]);
  }
  printf("\n");
  return 0;
}
