#include <bits/stdc++.h>
using namespace std;
pair<long long int, long long int> ar[100009];
long long int curx, cury, ax, ay, bx, by, mrk[100009];
class cmp {
 public:
  bool operator()(long long int& a, long long int& b) {
    ax = 2 * ar[a].first;
    ay = 2 * ar[a].second;
    bx = 2 * ar[b].first;
    by = 2 * ar[b].second;
    if ((ax * ax + ay * ay - 2 * (curx * ax + cury * ay)) >
        (bx * bx + by * by - 2 * (curx * bx + cury * by)))
      return true;
    else
      return false;
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n, i, u, v;
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> u >> v;
    curx += u;
    cury += v;
    ar[i] = pair<long long int, long long int>(u, v);
  }
  priority_queue<long long int, vector<long long int>, cmp> pq;
  for (i = 1; i <= n; i++) pq.push(i);
  while (curx >= 1500000 || cury >= 1500000 ||
         (4 * (curx * curx + cury * cury) >= 9 * 1e12)) {
    u = pq.top();
    curx -= 2 * ar[u].first;
    cury -= 2 * ar[u].second;
    pq.pop();
    mrk[u] = 1;
  }
  for (i = 1; i <= n; i++) {
    if (mrk[i])
      cout << -1 << " ";
    else
      cout << 1 << " ";
  }
  cout << "\n";
  return 0;
}
