#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
int n;
long long x[100015], y[100015];
struct gg {
  long long x, y;
  int index;
  gg() {}
  gg(long long x, long long y, int index) : x(x), y(y), index(index) {}
} g[100015];
long long pp(long long x) { return x * x; }
int ans[100015];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%lld%lld", &x[i], &y[i]);
    g[i] = gg(x[i], y[i], i);
  }
  while (1) {
    random_shuffle(g + 1, g + n + 1);
    long long tx = 0, ty = 0;
    for (int i = 1; i <= n; ++i) {
      if (pp(tx + g[i].x) + pp(ty + g[i].y) <
          pp(tx - g[i].x) + pp(ty - g[i].y)) {
        ans[g[i].index] = 1;
        tx += g[i].x, ty += g[i].y;
      } else {
        ans[g[i].index] = -1;
        tx -= g[i].x, ty -= g[i].y;
      }
    }
    if (tx * tx + ty * ty <= 2.25e12) break;
  }
  for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
  return 0;
}
