#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vd = vector<double>;
using vs = vector<string>;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll LIM = 1500000LL * 1500000LL;
struct xy_move {
  int x, y;
  int index;
};
int n;
vector<xy_move> moves;
vb flip;
ll sqdist(ll x, ll y) { return x * x + y * y; }
bool check() {
  ll x = 0, y = 0;
  for (auto m : moves) {
    ll x1 = x + m.x, y1 = y + m.y, x2 = x - m.x, y2 = y - m.y;
    if (sqdist(x1, y1) < sqdist(x2, y2)) {
      x = x1;
      y = y1;
      flip[m.index] = false;
    } else {
      x = x2;
      y = y2;
      flip[m.index] = true;
    }
  }
  return abs(x) <= 15e5 && abs(y) <= 15e5 && sqdist(x, y) <= LIM;
}
void solve() {
  int n;
  cin >> n;
  moves.resize(n);
  flip.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> moves[i].x >> moves[i].y;
    moves[i].index = i;
  }
  do {
    random_shuffle(moves.begin(), moves.end());
  } while (!check());
  for (int i = 0; i < n; i++) {
    if (flip[i])
      cout << -1 << " ";
    else
      cout << 1 << " ";
  }
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ll t = 1;
  while (t--) {
    solve();
  }
}
