#include <bits/stdc++.h>
using namespace std;
mt19937 ran(time(nullptr));
long long vx[100010], vy[100010];
int ord[100010], ans[100010];
inline int rnd(int p) { return ran() % p; }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld%lld", vx + i, vy + i);
    ord[i] = i;
  }
  bool found = false;
  while (!found) {
    random_shuffle(ord + 1, ord + 1 + n, rnd);
    long long cur_x = vx[ord[1]], cur_y = vy[ord[1]];
    ans[ord[1]] = 1;
    for (int i = 2; i <= n; i++) {
      long long nx1 = cur_x + vx[ord[i]], ny1 = cur_y + vy[ord[i]];
      long long nx2 = cur_x - vx[ord[i]], ny2 = cur_y - vy[ord[i]];
      if (nx1 * nx1 + ny1 * ny1 < nx2 * nx2 + ny2 * ny2) {
        cur_x = nx1, cur_y = ny1;
        ans[ord[i]] = 1;
      } else {
        cur_x = nx2, cur_y = ny2;
        ans[ord[i]] = -1;
      }
    }
    if (cur_x * cur_x + cur_y * cur_y <= 2250000000000ll) found = true;
  }
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  puts("");
  return 0;
}
