#include <bits/stdc++.h>
using namespace std;
const long long lim = 1000000000000;
struct p {
  long long x, y;
};
p operator+(p a, p b) { return {a.x + b.x, a.y + b.y}; }
p operator-(p a, p b) { return {a.x - b.x, a.y - b.y}; }
long long norm(p a) { return a.x * a.x + a.y * a.y; }
int main() {
  int n;
  cin >> n;
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  vector<p> points(2 * n - 1);
  vector<pair<int, int>> parents(2 * n - 1);
  vector<int> sign(2 * n - 1, 1);
  for (int i = 0; i < n; i++) {
    cin >> points[i].x >> points[i].y;
  }
  vector<pair<p, int>> workset;
  workset.push_back({points[0], 0});
  workset.push_back({points[1], 1});
  int j = 2;
  int k = n;
  while (j < k) {
    workset.push_back({points[j], j});
    j++;
    vector<pair<p, int>> nextset;
    if (norm(workset[0].first + workset[1].first) <= lim) {
      sign[k] = 1;
      parents[k] = {workset[0].second, workset[1].second};
      points[k] = workset[0].first + workset[1].first;
      nextset.push_back(workset[2]);
      nextset.push_back({points[j], j});
      j++;
      k++;
    } else if (norm(workset[0].first - workset[1].first) <= lim) {
      sign[k] = -1;
      parents[k] = {workset[0].second, workset[1].second};
      points[k] = workset[0].first - workset[1].first;
      nextset.push_back(workset[2]);
      nextset.push_back({points[j], j});
      j++;
      k++;
    } else if (norm(workset[0].first + workset[2].first) <= lim) {
      sign[k] = 1;
      parents[k] = {workset[0].second, workset[2].second};
      points[k] = workset[0].first + workset[2].first;
      nextset.push_back(workset[1]);
      nextset.push_back({points[j], j});
      j++;
      k++;
    } else if (norm(workset[0].first - workset[2].first) <= lim) {
      sign[k] = -1;
      parents[k] = {workset[0].second, workset[2].second};
      points[k] = workset[0].first - workset[2].first;
      nextset.push_back(workset[1]);
      nextset.push_back({points[j], j});
      j++;
      k++;
    } else if (norm(workset[1].first + workset[2].first) <= lim) {
      sign[k] = 1;
      parents[k] = {workset[1].second, workset[2].second};
      points[k] = workset[1].first + workset[2].first;
      nextset.push_back(workset[0]);
      nextset.push_back({points[j], j});
      j++;
      k++;
    } else {
      sign[k] = -1;
      parents[k] = {workset[1].second, workset[2].second};
      points[k] = workset[1].first - workset[2].first;
      nextset.push_back(workset[0]);
      nextset.push_back({points[j], j});
      j++;
      k++;
    }
    nextset.swap(workset);
  }
  if (norm(workset[0].first + workset[1].first) <
      norm(workset[0].first - workset[1].first)) {
    sign[2 * n - 2] = 1;
    parents[2 * n - 2] = {workset[0].second, workset[1].second};
    points[2 * n - 2] = workset[0].first + workset[1].first;
  } else {
    sign[2 * n - 2] = -1;
    parents[2 * n - 2] = {workset[0].second, workset[1].second};
    points[2 * n - 2] = workset[0].first - workset[1].first;
  }
  queue<pair<int, int>> work;
  work.push({2 * n - 2, 1});
  while (!work.empty()) {
    auto cur = work.front();
    work.pop();
    if (cur.first < n) {
      sign[cur.first] = cur.second;
    } else {
      work.push({parents[cur.first].first, cur.second});
      work.push({parents[cur.first].second, cur.second * sign[cur.first]});
    }
  }
  for (int i = 0; i < n; i++) {
    if (i != 0) cout << " ";
    cout << sign[i];
  }
  cout << endl;
  return 0;
}
