#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;
const double eps = 1e-8;
const int maxn = 100005;
const int maxm = 200005;
struct node {
  int x, y;
  long double len;
  int id;
  bool operator<(const node b) { return len > b.len; }
};
vector<node> v;
int ans[maxn];
int n;
void solve() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    long double len = (long long)x * x + (long long)y * y;
    v.push_back((node){x, y, len, i});
  }
  long long ansx = 0, ansy = 0;
  for (int i = n - 1; i >= 0; i--) {
    double p, n;
    p = (ansx + v[i].x) * (ansx + v[i].x) + (ansy + v[i].y) * (ansy + v[i].y);
    n = (ansx - v[i].x) * (ansx - v[i].x) + (ansy - v[i].y) * (ansy - v[i].y);
    if (p <= n) {
      ans[v[i].id] = 1;
      ansx += v[i].x;
      ansy += v[i].y;
    } else {
      ans[v[i].id] = -1;
      ansx -= v[i].x;
      ansy -= v[i].y;
    }
  }
  for (int i = 0; i < n; i++) {
    printf("%d%c", ans[i], i == n - 1 ? '\n' : ' ');
  }
  return;
}
int main() {
  solve();
  return 0;
}
