#include <bits/stdc++.h>
using namespace std;
pair<int, int> operator+(pair<int, int> &a, pair<int, int> &b) {
  return {a.first + b.first, a.second + b.second};
}
pair<int, int> operator-(pair<int, int> &a, pair<int, int> &b) {
  return {a.first - b.first, a.second - b.second};
}
long long len2(pair<int, int> a) {
  return 1LL * a.first * a.first + 1LL * a.second * a.second;
}
int n;
vector<pair<pair<int, int>, int> > v;
vector<int> res;
bool solve() {
  random_shuffle(v.begin(), v.end());
  pair<int, int> now = {0, 0};
  for (int i = 0; i < n; i++) {
    if (len2(now - v[i].first) < len2(now + v[i].first)) {
      now = now - v[i].first;
      res[v[i].second] = -1;
    } else {
      now = now + v[i].first;
      res[v[i].second] = 1;
    }
  }
  return len2(now) <= 1LL * 1500000 * 1500000;
}
int main() {
  cin >> n;
  v.resize(n);
  res.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i].first.first >> v[i].first.second;
    v[i].second = i;
  }
  while (!solve()) {
  }
  for (auto &i : res) cout << i << " ";
  return 0;
}
