#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
long long len(const long long x, const long long y) { return x * x + y * y; }
struct ky {
  int x, y, id;
} a[N];
long long x, y;
int n, ans[N];
int main() {
  scanf("%d", &n), srand(19260817);
  register int i;
  for (i = 1; i <= n; ++i) scanf("%d%d", &a[i].x, &a[i].y), a[i].id = i;
  while (1) {
    x = 0, y = 0;
    register int p = 0, q = 0;
    for (i = 1; i <= n; ++i) {
      p = a[i].x, q = a[i].y;
      if (len(x + p, y + q) < len(x - p, y - q))
        x += p, y += q, ans[a[i].id] = 1;
      else
        x -= p, y -= q, ans[a[i].id] = -1;
    }
    if (sqrt(1.0 * len(x, y)) <= 1.5e6) {
      for (i = 1; i <= n; ++i) printf("%d ", ans[i]);
      return 0;
    }
    random_shuffle(a + 1, a + n + 1);
  }
  return 0;
}
