#include <bits/stdc++.h>
using namespace std;
const double PI = 2.0 * acos(0.0);
double EPSILON = 1e-9;
double INFTY = 1e200;
struct vector2 {
  double x, y;
  int idx;
  explicit vector2(double x_ = 0, double y_ = 0) : x(x_), y(y_) {}
  bool operator==(const vector2& rhs) const { return x == rhs.x && y == rhs.y; }
  bool operator<(const vector2& rhs) const {
    return x != rhs.x ? x < rhs.x : y < rhs.y;
  }
  vector2 operator+(const vector2& rhs) const {
    return vector2(x + rhs.x, y + rhs.y);
  }
  vector2 operator-(const vector2& rhs) const {
    return vector2(x - rhs.x, y - rhs.y);
  }
  vector2 operator*(double rhs) const { return vector2(x * rhs, y * rhs); }
  double norm() const { return hypot(x, y); }
  vector2 normalize() const { return vector2(x / norm(), y / norm()); }
  double polar() const { return fmod(atan2(y, x) + 2 * PI, 2 * PI); }
  double dot(const vector2& rhs) const { return x * rhs.x + y * rhs.y; }
  double cross(const vector2& rhs) const { return x * rhs.y - rhs.x * y; }
  vector2 project(const vector2& rhs) const {
    vector2 r = rhs.normalize();
    return r * r.dot(*this);
  }
} p[100004];
bool cmp(vector2 v, vector2 u) { return v.norm() > u.norm(); }
int n;
int main() {
  std::srand(unsigned(std::time(0)));
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> p[i].x >> p[i].y;
    p[i].idx = i;
  }
  int ans[100004];
  while (1) {
    random_shuffle(p, p + n);
    vector2 v = p[0];
    ans[p[0].idx] = 1;
    for (int i = 1; i < n; i++) {
      vector2 u1 = v + p[i];
      vector2 u2 = v - p[i];
      if (u1.norm() < u2.norm()) {
        v = u1;
        ans[p[i].idx] = 1;
      } else {
        v = u2;
        ans[p[i].idx] = -1;
      }
    }
    if (v.norm() <= 1.5e6) break;
  }
  for (int i = 0; i < n; i++) cout << ans[i] << " ";
  return 0;
}
