#include <bits/stdc++.h>
using namespace std;
void Solve() {
  long long n;
  cin >> n;
  vector<pair<pair<long long, long long>, long long> > a(n);
  vector<long long> ans(n);
  for (long long i = 0; i < (n); ++i) {
    cin >> a[i].first.first >> a[i].first.second;
    a[i].second = i;
    if (a[i].first.first < 0) {
      a[i].first.first = -a[i].first.first;
      a[i].first.second = -a[i].first.second;
      ans[i] ^= 1;
    }
  }
  sort((a).begin(), (a).end(),
       [](pair<pair<long long, long long>, long long> a,
          pair<pair<long long, long long>, long long> b) {
         return a.first.second * b.first.first < a.first.first * b.first.second;
       });
  long long x = a[0].first.first, y = a[0].first.second;
  for (long long i = 1; i < n; ++i) {
    long long x1 = x - a[i].first.first, y1 = y - a[i].first.second;
    long long x2 = x + a[i].first.first, y2 = y + a[i].first.second;
    if (x1 * x1 + y1 * y1 < x2 * x2 + y2 * y2) {
      ans[a[i].second] ^= 1;
      x = x1, y = y1;
    } else {
      x = x2, y = y2;
    }
  }
  for (long long i = 0; i < (n); ++i) {
    cout << (ans[i] ? -1 : 1) << ' ';
  }
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie();
  Solve();
  return 0;
}
