#include <bits/stdc++.h>
using namespace std;
const double yo = 1.5 * 1e6;
struct node {
  long long x, y, id;
} s[100005];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%lld%lld", &s[i].x, &s[i].y);
    s[i].id = i;
  }
  int ans[100005] = {0};
  while (1) {
    random_shuffle(s + 1, s + 1 + n);
    long long sx = 0, sy = 0;
    for (int i = 1; i <= n; ++i) {
      bool f = true;
      long long x = s[i].x, y = s[i].y;
      long long tx1 = sx + x, ty1 = sy + y, tx2 = sx - x, ty2 = sy - y;
      double ts1 = tx1 * tx1 + ty1 * ty1, ts2 = tx2 * tx2 + ty2 * ty2;
      ts1 = sqrt(ts1);
      ts2 = sqrt(ts2);
      if (ts1 < ts2) {
        f = true;
        sx = tx1, sy = ty1;
      } else if (ts1 > ts2) {
        f = false;
        sx = tx2, sy = ty2;
      } else {
        if (sx >= 0 && sy >= 0) {
          f = false;
          sx = tx2, sy = ty2;
        } else {
          f = true;
          sx = tx1, sy = ty1;
        }
      }
      ans[s[i].id] = f ? 1 : -1;
    }
    if (sx * sx + sy * sy <= yo * yo) {
      for (int i = 1; i <= n; ++i) {
        printf("%d%c", ans[i], i == n ? '\n' : ' ');
      }
      break;
    }
  }
  return 0;
}
