#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
const int mod = 1e9 + 7;
using ll = long long;
struct Point {
  int x, y, id;
  Point operator*(const int &a) const { return Point{x * a, y * a}; }
  Point operator+(const Point &a) const { return Point{x + a.x, y + a.y}; }
} a[maxn];
const ll M = 1.5e6 * 1.5e6;
inline ll getdis(Point a) { return 1LL * a.x * a.x + 1LL * a.y * a.y; }
bool cmp(const Point &a, const Point &b) { return a.x * b.y < a.y * b.x; }
inline Point check(Point &a, Point &b) {
  ll dis;
  dis = getdis(a + b);
  if (dis <= M) return {1, 1};
  dis = getdis(a + (b * -1));
  if (dis <= M) return {1, -1};
  dis = getdis((a * -1) + b);
  if (dis <= M) return {-1, 1};
  dis = getdis((a * -1) + (b * -1));
  if (dis <= M) return {-1, -1};
  return {0, 0};
}
int ans[maxn], lazy[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d%d", &a[i].x, &a[i].y), a[i].id = i;
  for (int i = 1; i <= n; ++i) ans[i] = 1, lazy[i] = 1;
  sort(a + 1, a + n + 1, cmp);
  for (int i = 1; i < n; ++i) {
    Point c = {0, 0};
    for (int j = i + 1; j <= n; ++j) {
      c = check(a[i], a[j]);
      if (c.x != 0) {
        swap(a[j], a[i + 1]);
        break;
      }
    }
    if (c.x == 0) c = {1, 1};
    ans[a[i + 1].id] = c.y;
    a[i + 1] = a[i] * c.x + a[i + 1] * c.y;
    lazy[i] = c.x;
  }
  int sta = 1;
  for (int i = n; i >= 1; --i) {
    sta *= lazy[i];
    ans[a[i].id] *= sta;
  }
  for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
  return 0;
}
