#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;
inline void cmin(int &x, int y) {
  if (y < x) x = y;
}
inline void cmax(int &x, int y) {
  if (y > x) x = y;
}
const int N = 101000;
int n, x, y, way[N];
pair<pair<int, int>, int> p[N];
int main() {
  scanf("%d", &n);
  for (int(i) = (0); (i) <= (n - 1); ++i) {
    scanf("%d%d", &x, &y);
    p[i] = make_pair(make_pair(x, y), i);
  }
  while (1) {
    random_shuffle(p, p + n);
    long long x = 0, y = 0;
    for (int(i) = (0); (i) <= (n - 1); ++i) {
      long long ux = x + p[i].first.first, uy = y + p[i].first.second;
      long long vx = x - p[i].first.first, vy = y - p[i].first.second;
      if (ux * ux + uy * uy < vx * vx + vy * vy) {
        way[p[i].second] = 1;
        x = ux;
        y = uy;
      } else {
        way[p[i].second] = -1;
        x = vx;
        y = vy;
      }
    }
    if (x * x + y * y <= 2250000000000ll) {
      for (int(i) = (0); (i) <= (n - 1); ++i) printf("%d ", way[i]);
      puts("");
      return 0;
    }
  }
}
