#include <bits/stdc++.h>
using namespace std;
template <class t>
inline t read(t &x) {
  char c = getchar();
  bool f = 0;
  x = 0;
  while (!isdigit(c)) f |= c == '-', c = getchar();
  while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
  if (f) x = -x;
  return x;
}
template <class t, class... A>
inline void read(t &x, A &...a) {
  read(x);
  read(a...);
}
template <class t>
inline void write(t x) {
  if (x < 0)
    putchar('-'), write(-x);
  else {
    if (x > 9) write(x / 10);
    putchar('0' + x % 10);
  }
}
const long long N = 1e5 + 5;
long long n, a[N], b[N], id[N], prex[N], prey[N], sufx[N], sufy[N];
bool tg[N];
bool check(long long first, long long second) {
  return sqrt(first * first + second * second) <= 1500000;
}
signed main() {
  read(n);
  for (long long i = 1; i <= n; i++) read(a[i], b[i]), id[i] = i;
  for (;;) {
    random_shuffle(id + 1, id + 1 + n);
    for (long long i = 1; i <= n; i++)
      prex[i] = prex[i - 1] + a[id[i]], prey[i] = prey[i - 1] + b[id[i]];
    for (long long i = n; i; i--)
      sufx[i] = sufx[i + 1] + a[id[i]], sufy[i] = sufy[i + 1] + b[id[i]];
    for (long long i = 0; i <= n; i++)
      if (check(prex[i] - sufx[i + 1], prey[i] - sufy[i + 1])) {
        for (long long j = i + 1; j <= n; j++) tg[id[j]] = 1;
        for (long long i = 1; i <= n; i++) write(tg[i] ? -1 : 1), putchar(' ');
        return 0;
      }
  }
}
