#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
struct Point {
  int id;
  long long x, y, d;
  Point(long long x, long long y) {
    this->x = x;
    this->y = y;
    this->d = x * x + y * y;
  }
  Point() {}
  inline bool operator<(const Point& other) const { return this->d < other.d; }
};
Point p[maxn];
inline Point operator+(Point a, Point b) { return Point(a.x + b.x, a.y + b.y); }
inline Point operator-(Point a, Point b) { return Point(a.x - b.x, a.y - b.y); }
inline bool cmp(Point x, Point y) { return x.d > y.d; }
int ans[maxn];
int anss[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    long long x, y;
    scanf("%lld%lld", &x, &y);
    p[i] = Point(x, y);
    p[i].id = i;
  }
  Point lst = Point(0x3f3f3f3fLL, 0x3f3f3f3fLL);
  sort(p + 1, p + n + 1, cmp);
  for (int i = 1; i <= 10; ++i) {
    Point now = Point(0LL, 0LL);
    for (int i = 1; i <= n; ++i) {
      if (now + p[i] < now - p[i]) {
        now = now + p[i];
        ans[p[i].id] = 1;
      } else {
        now = now - p[i];
        ans[p[i].id] = -1;
      }
    }
    if (now < lst)
      for (int i = 1; i <= n; ++i) anss[i] = ans[i];
    random_shuffle(p + 1, p + n + 1);
  }
  for (int i = 1; i <= n; ++i) printf("%d ", anss[i]);
  return 0;
}
