#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int r = 1e6;
const int lim = 1.5e6;
struct point {
  int x, y;
  point() {}
  point(int _x, int _y) : x(_x), y(_y) {}
  point operator+(const point& other) const {
    return point(x + other.x, y + other.y);
  }
  point operator*(int k) const { return point(x * k, y * k); }
};
long long sqr_len(point u) { return u.x * 1LL * u.x + u.y * 1LL * u.y; }
int n;
point moves[maxn];
int nvertex;
vector<int> gr[maxn];
int state[maxn];
int ans[maxn];
void read_input() {
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> moves[i].x >> moves[i].y;
}
void dfs(int u, int cur) {
  cur ^= state[u];
  if (cur)
    ans[u] = -1;
  else
    ans[u] = 1;
  for (auto& v : gr[u]) dfs(v, cur);
}
void solve() {
  if (n == 1) {
    cout << "1\n";
    return;
  }
  vector<pair<point, int>> cur;
  for (int i = 1; i <= 2; ++i) cur.push_back(make_pair(moves[i], i));
  nvertex = n;
  for (int i = 3; i <= n; ++i) {
    cur.push_back(make_pair(moves[i], i));
    bool ok = false;
    ++nvertex;
    for (int j = 0; j < 3; ++j)
      for (int k = j + 1; k < 3; ++k)
        for (int signj = -1; signj < 2; signj += 2)
          for (int signk = -1; signk < 2; signk += 2)
            if (!ok && sqr_len(cur[j].first * signj + cur[k].first * signk) <=
                           r * 1LL * r) {
              ok = true;
              point new_move = cur[j].first * signj + cur[k].first * signk;
              if (signj == -1) state[cur[j].second] = 1;
              if (signk == -1) state[cur[k].second] = 1;
              gr[nvertex].push_back(cur[j].second);
              gr[nvertex].push_back(cur[k].second);
              pair<point, int> temp;
              for (int t = 0; t < 3; ++t)
                if (t != j && t != k) temp = cur[t];
              cur.clear();
              cur.push_back(temp);
              cur.push_back(make_pair(new_move, nvertex));
            }
    assert(ok);
  }
  ++nvertex;
  bool ok = false;
  for (int j = 0; j < 2; ++j)
    for (int k = j + 1; k < 2; ++k)
      for (int signj = -1; signj < 2; signj += 2)
        for (int signk = -1; signk < 2; signk += 2)
          if (!ok && sqr_len(cur[j].first * signj + cur[k].first * signk) <=
                         lim * 1LL * lim) {
            ok = true;
            if (signj == -1) state[cur[j].second] = 1;
            if (signk == -1) state[cur[k].second] = 1;
            gr[nvertex].push_back(cur[j].second);
            gr[nvertex].push_back(cur[k].second);
          }
  assert(ok);
  dfs(nvertex, 0);
  for (int i = 1; i <= n; ++i) cout << ans[i] << ' ';
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  read_input();
  solve();
}
