#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, lim = 1.5e6;
mt19937 mt(time(0) + (size_t) new int);
struct point {
  long long x, y;
  inline point operator+(const point& rhs) const {
    return (point){x + rhs.x, y + rhs.y};
  }
  inline point operator-(const point& rhs) const {
    return (point){x - rhs.x, y - rhs.y};
  }
  inline double length() { return sqrt(x * x + y * y); }
} a[N], p;
int n, fh[N];
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i].x >> a[i].y;
    fh[i] = 2 * int(mt() % 2) - 1;
    a[i].x *= fh[i], a[i].y *= fh[i];
    p = p + a[i];
  }
  while (p.length() > lim) {
    for (int T = 1; T <= 100000; ++T) {
      int t = mt() % n + 1;
      point q = p - a[t] - a[t];
      if (q.length() < p.length()) {
        a[t].x *= -1, a[t].y *= -1;
        fh[t] *= -1;
        p = q;
      }
      if (p.length() <= lim) break;
    }
    if (p.length() <= lim) break;
    p = (point){0, 0};
    for (int i = 1; i <= n; ++i) {
      a[i].x *= fh[i], a[i].y *= fh[i];
      fh[i] = 2 * int(mt() % 2) - 1;
      a[i].x *= fh[i], a[i].y *= fh[i];
      p = p + a[i];
    }
  }
  for (int i = 1; i <= n; ++i) cout << fh[i] << ' ';
  return 0;
}
