#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e5;
short int semn[4 * nmax + 1], rasp[nmax + 1];
pair<pair<int, int>, int> v[nmax + 1];
long long lg(pair<int, int> a) {
  return 1LL * a.first * a.first + 1LL * a.second * a.second;
}
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};
}
pair<int, int> solve(int nod, int x, int y) {
  semn[nod] = 1;
  if (x == y) {
    return v[x].first;
  }
  int mij = (x + y) / 2;
  pair<int, int> st, dr;
  st = solve(2 * nod, x, mij);
  dr = solve(2 * nod + 1, mij + 1, y);
  if (lg(st + dr) < lg(st - dr)) {
    return st + dr;
  } else {
    semn[2 * nod + 1] *= -1;
    return st - dr;
  }
  return {-1, -1};
}
void dfs(int nod, int x, int y) {
  if (x == y) {
    rasp[v[x].second] = semn[nod];
    return;
  }
  int mij = (x + y) / 2;
  semn[2 * nod] *= semn[nod];
  semn[2 * nod + 1] *= semn[nod];
  dfs(2 * nod, x, mij);
  dfs(2 * nod + 1, mij + 1, y);
}
int main() {
  cin.sync_with_stdio(false);
  cin.tie();
  cout.tie();
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> v[i].first.first >> v[i].first.second;
    v[i].second = i;
  }
  srand(time(0));
  while (1) {
    random_shuffle(v + 1, v + n + 1);
    pair<int, int> vct = solve(1, 1, n);
    if (sqrt(lg(vct)) <= 1e6 * 1.5) {
      dfs(1, 1, n);
      for (int i = 1; i <= n; ++i) {
        cout << rasp[i] << " ";
      }
      cout << "\n";
      break;
    }
  }
  return 0;
}
