#include <bits/stdc++.h>
using namespace std;
const int max_n = 100011, log_n = 32, max_m = 111, mod = 1000000007,
          inf = 1011111111;
int n, ans[max_n];
pair<int, int> a[max_n];
long long dist(pair<int, int> &a) {
  return 1LL * a.first * a.first + 1LL * a.second * a.second;
}
long long dist(int x, int y) { return 1LL * x * x + 1LL * y * y; }
bool is_good(pair<int, int> &a, pair<int, int> &b) {
  return sqrt(dist(a)) * sqrt(dist(b)) <=
         abs(2LL * a.first * b.first + 2LL * a.second * b.second);
}
int coeff(pair<int, int> a, pair<int, int> b) {
  if (dist(a.first + b.first, a.second + b.second) <
      dist(a.first - b.first, a.second - b.second))
    return 1;
  return -1;
}
pair<int, int> sum(pair<int, int> &a, pair<int, int> b) {
  return make_pair(a.first + b.first, a.second + b.second);
}
pair<int, int> mul(pair<int, int> &a, int b) {
  return make_pair(a.first * b, a.second * b);
}
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", &a[i].first, &a[i].second);
  }
  if (n < 2) {
    for (int i = 0; i < n; ++i) cout << "1 ";
    return 0;
  }
  pair<int, int> x = a[0];
  pair<pair<int, int>, vector<int> > y = make_pair(a[1], vector<int>(1, 1));
  ans[0] = ans[1] = 1;
  for (int i = 2; i < n; ++i) {
    if (is_good(x, y.first)) {
      int c = coeff(x, y.first);
      if (c == -1) {
        for (int q = 0; q < y.second.size(); ++q) {
          ans[y.second[q]] *= -1;
        }
      }
      x = sum(x, mul(y.first, c));
      y = make_pair(a[i], vector<int>(1, i));
      ans[i] = 1;
    } else {
      if (is_good(x, a[i])) {
        int c = coeff(x, a[i]);
        ans[i] = c;
        x = sum(x, mul(a[i], c));
      } else {
        assert(is_good(y.first, a[i]));
        int c = coeff(y.first, a[i]);
        ans[i] = c;
        y.first = sum(y.first, mul(a[i], c));
        y.second.push_back(i);
      }
    }
    assert(dist(x) <= 1000000000000LL);
    assert(dist(y.first) <= 1000000000000LL);
  }
  int c = coeff(x, y.first);
  if (c == -1) {
    for (int q = 0; q < y.second.size(); ++q) {
      ans[y.second[q]] *= -1;
    }
  }
  x = sum(x, mul(y.first, c));
  assert(dist(x) <= 2250000000000LL);
  for (int i = 0; i < n; ++i) {
    printf("%d ", ans[i]);
  }
  return 0;
}
