#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
pair<pair<int, int>, int> p[MAXN];
int op[MAXN];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &p[i].first.first, &p[i].first.second);
    p[i].second = i;
  }
  while (1) {
    random_shuffle(p + 1, p + 1 + n);
    int nx, ny, ux, uy, vx, vy;
    nx = ny = 0;
    for (int i = 1; i <= n; i++) {
      ux = nx + p[i].first.first;
      uy = ny + p[i].first.second;
      vx = nx - p[i].first.first;
      vy = ny - p[i].first.second;
      if (1LL * ux * ux + 1LL * uy * uy < 1LL * vx * vx + 1LL * vy * vy)
        nx += p[i].first.first, ny += p[i].first.second, op[p[i].second] = 1;
      else
        nx -= p[i].first.first, ny -= p[i].first.second, op[p[i].second] = -1;
    }
    if (1LL * nx * nx + 1LL * ny * ny < 2250000000000LL) {
      for (int i = 1; i <= n; i++) {
        printf("%d ", op[i]);
      }
      printf("\n");
      break;
    }
  }
  return 0;
}
