#include <bits/stdc++.h>
using namespace std;
const int N = 500500;
const int mod = 1e9 + 7;
const long long inf = 1e18;
int x[N], y[N];
int n;
int ans[N];
inline long long calc(long long x, long long y) { return x * x + y * y; }
int id[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  srand(time(NULL));
  for (long long i = 1; i <= n; ++i) id[i] = i;
  for (long long i = 1; i <= n; ++i) cin >> x[i] >> y[i], id[i] = i;
  do {
    int X = 0, Y = 0;
    for (long long i = 1; i <= n; ++i) {
      int nx1 = abs(X + x[i]);
      int ny1 = abs(Y + y[i]);
      int nx2 = abs(X - x[i]);
      int ny2 = abs(Y - y[i]);
      if (max(nx1, ny1) <= max(nx2, ny2)) {
        X += x[i];
        Y += y[i];
        ans[id[i]] = 1;
      } else {
        X -= x[i];
        Y -= y[i];
        ans[id[i]] = -1;
      }
    }
    if (calc(X, Y) <= 1500000ll * 1500000) {
      for (long long i = 1; i <= n; ++i) cout << ans[i] << ' ';
      return 0;
    }
    for (long long i = 1; i <= n; ++i) {
      int j = rand() % n + 1;
      swap(x[j], x[i]);
      swap(y[i], y[j]);
      swap(id[i], id[j]);
    }
  } while (true);
  return 0;
}
