#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
const double MAX_DIST = 15e5;
int x[N], y[N], ans[N];
long long dist(long long x, long long y) { return x * x + y * y; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  vector<pair<long long, int>> vv(n);
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
    vv[i] = make_pair(dist(x[i], y[i]), i);
  }
  sort(vv.begin(), vv.end());
  long long xx = 0, yy = 0;
  for (int i = 0; i < vv.size(); i++) {
    int idx = vv[i].second;
    if (dist(xx + x[idx], yy + y[idx]) > dist(xx - x[idx], yy - y[idx])) {
      ans[idx] = -1;
    } else {
      ans[idx] = 1;
    }
    xx += ans[idx] * x[idx];
    yy += ans[idx] * y[idx];
  }
  if (sqrt(dist(xx, yy)) > MAX_DIST) {
    xx = 0, yy = 0;
    for (int i = vv.size() - 1; i >= 0; i--) {
      int idx = vv[i].second;
      if (dist(xx + x[idx], yy + y[idx]) > dist(xx - x[idx], yy - y[idx])) {
        ans[idx] = -1;
      } else {
        ans[idx] = 1;
      }
      xx += ans[idx] * x[idx];
      yy += ans[idx] * y[idx];
    }
  }
  for (int i = 0; i < n; i++) {
    cout << ans[i] << " ";
  }
  cout << endl;
  return 0;
}
