#include <bits/stdc++.h>
using namespace std;
int const N = 100000;
long long const inf = 1000000ll * 1000000ll, inf2 = 1500000ll * 1500000ll;
int n;
vector<pair<int, bool> > g[N];
bool an[N];
struct V {
  int x, y, id;
  V() {}
  V(int a, int b, int i) : x(a), y(b), id(i) {}
  void sc(int i) {
    scanf("%d%d", &x, &y);
    id = i;
  }
  V operator+(V o) { return V(x + o.x, y + o.y, id); }
  V operator-() { return V(-x, -y, id); }
  long long L() { return (long long)x * x + (long long)y * y; }
} v[N];
void ad(int i, int j, bool flp) {
  g[i].push_back(make_pair(j, flp));
  g[j].push_back(make_pair(i, flp));
}
void go(int v, int p = -1, bool cl = true) {
  an[v] = cl;
  for (int i = 0; i < (int)(g[v].size()); ++i) {
    int u = g[v][i].first;
    if (u == p) continue;
    go(u, v, cl ^ g[v][i].second);
  }
}
int main() {
  scanf("%d", &n);
  if (n == 1) {
    printf("1\n");
    return 0;
  }
  for (int i = 0; i < (int)(n); ++i) v[i].sc(i);
  int t = n;
  --n;
  while (n > 1) {
    if ((v[n] + v[n - 1]).L() <= inf)
      ad(v[n].id, v[n - 1].id, false), v[n - 1] = v[n] + v[n - 1];
    else if ((v[n] + -v[n - 1]).L() <= inf)
      ad(v[n].id, v[n - 1].id, true), v[n - 1] = v[n] + -v[n - 1];
    else if ((v[n] + v[n - 2]).L() <= inf)
      ad(v[n].id, v[n - 2].id, false), v[n - 2] = v[n] + v[n - 2];
    else if ((v[n] + -v[n - 2]).L() <= inf)
      ad(v[n].id, v[n - 2].id, true), v[n - 2] = v[n] + -v[n - 2];
    else if ((v[n - 1] + v[n - 2]).L() <= inf)
      ad(v[n - 1].id, v[n - 2].id, false), v[n - 2] = v[n - 2] + v[n - 1],
                                                 swap(v[n - 1], v[n]);
    else
      ad(v[n - 1].id, v[n - 2].id, true), v[n - 2] = v[n - 2] + -v[n - 1],
                                                swap(v[n - 1], v[n]);
    --n;
  }
  go(v[0].id);
  if ((v[0] + v[1]).L() <= inf2)
    go(v[1].id);
  else
    go(v[1].id, -1, false);
  printf("%d", an[0] ? 1 : -1);
  for (int i = 1; i < (int)(t); ++i) printf(" %d", an[i] ? 1 : -1);
  printf("\n");
}
