#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e5 + 5;
inline long long dist(long long x, long long y) {
  return 1ll * x * x + 1ll * y * y;
}
long long n;
pair<pair<long long, long long>, long long> a[MAXN];
long long res[MAXN];
long long xor_delta[MAXN];
long long ans[MAXN];
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i].first.first >> a[i].first.second;
    a[i].second = i;
  }
  while (1) {
    mt19937 rng(std::chrono::system_clock::now().time_since_epoch().count());
    for (long long i = n; i >= 1; i--) {
      uniform_int_distribution<long long> r(1, i);
      swap(a[i], a[r(rng)]);
    }
    memset(xor_delta, 0, sizeof xor_delta);
    memset(res, 0, sizeof res);
    long long x = 0, y = 0;
    for (long long i = 1; i <= n; i++) {
      long long d1 = dist(x + a[i].first.first, y + a[i].first.second);
      long long d2 = dist(x - a[i].first.first, y - a[i].first.second);
      long long d3 = dist(-x + a[i].first.first, -y + a[i].first.second);
      long long d4 = dist(-x - a[i].first.first, -y - a[i].first.second);
      long long mn = min({d1, d2, d3, d4});
      if (d1 == mn) {
        x += a[i].first.first;
        y += a[i].first.second;
        res[i] = 1;
      } else if (d2 == mn) {
        x -= a[i].first.first;
        y -= a[i].first.second;
        res[i] = -1;
      } else if (d3 == mn) {
        xor_delta[1] ^= 1;
        xor_delta[i] ^= 1;
        x = -x;
        y = -y;
        x += a[i].first.first;
        y += a[i].first.second;
        res[i] = 1;
      } else {
        xor_delta[1] ^= 1;
        xor_delta[i] ^= 1;
        x = -x;
        y = -y;
        x -= a[i].first.first;
        y -= a[i].first.second;
        res[i] = -1;
      }
    }
    if (dist(x, y) > 2250000000000ll) {
      continue;
    }
    long long cur = 0;
    for (long long i = 1; i <= n; i++) {
      cur ^= xor_delta[i];
      if (cur) {
        res[i] = -res[i];
      }
    }
    x = 0, y = 0;
    for (long long i = 1; i <= n; i++) {
      x += res[i] * a[i].first.first;
      y += res[i] * a[i].first.second;
      ans[a[i].second] = res[i];
    }
    for (long long i = 1; i <= n; i++) {
      cout << ans[i] << ' ';
    }
    cout << endl;
    return 0;
  }
  return 0;
}
