#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct Pt {
  long long x, y;
  Pt() {}
  Pt(long long x, long long y) : x(x), y(y) {}
  void read() { cin >> x >> y; }
  Pt operator+(Pt &p) { return Pt(x + p.x, y + p.y); }
  Pt operator-(Pt &p) { return Pt(x - p.x, y - p.y); }
  long long dist2() { return x * x + y * y; }
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<pair<Pt, int> > vec(n);
  for (int i = 0; i < int(n); ++i) {
    vec[i].first.read();
    vec[i].second = i;
  }
  vector<int> sign(n);
  Pt ans(10000000, 10000000);
  while (ans.dist2() > (long long)1500000 * 1500000) {
    ans = Pt(0, 0);
    for (int i = 0; i < n; ++i) {
      if ((ans + vec[i].first).dist2() < (ans - vec[i].first).dist2()) {
        sign[vec[i].second] = 1;
        ans = ans + vec[i].first;
      } else {
        sign[vec[i].second] = -1;
        ans = ans - vec[i].first;
      }
    }
    shuffle(vec.begin(), vec.end(), rng);
  }
  for (int i = 0; i < n; ++i) {
    cout << sign[i] << " ";
  }
  cout << '\n';
  return 0;
}
