#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  int n, a, b;
  long long x, y, X[3], Y[3], g;
  cin >> n;
  int P[n];
  vector<int> V[3];
  if (n == 1) {
    cout << 1;
    return 0;
  }
  for (int i = 0; i < 2; i++) {
    cin >> x >> y;
    V[i].push_back(i);
    X[i] = x;
    Y[i] = y;
    P[i] = 1;
  }
  for (int i = 2; i < n; i++) {
    cin >> x >> y;
    g = 1;
    for (int u = 0; u < 2; u++) {
      if (sqrt((x + X[u]) * (x + X[u]) + (y + Y[u]) * (y + Y[u])) <= 1000000 &&
          g == 1) {
        X[u] += x;
        Y[u] += y;
        V[u].push_back(i);
        P[i] = 1;
        g = 0;
      }
      if (sqrt((x - X[u]) * (x - X[u]) + (y - Y[u]) * (y - Y[u])) <= 1000000 &&
          g == 1) {
        X[u] -= x;
        Y[u] -= y;
        V[u].push_back(i);
        P[i] = -1;
        g = 0;
      }
    }
    if (g == 1) {
      P[i] = 1;
      V[2].clear();
      V[2].push_back(i);
      a = 0;
      b = 1;
      if (V[1].size() > V[0].size()) {
        swap(a, b);
      }
      if (sqrt((X[0] - X[1]) * (X[0] - X[1]) + (Y[0] - Y[1]) * (Y[0] - Y[1])) <=
          1000000) {
        for (int u = 0; u < V[b].size(); u++) {
          P[V[b][u]] *= -1;
        }
        X[a] -= X[b];
        Y[a] -= Y[b];
      } else {
        X[a] += X[b];
        Y[a] += Y[b];
      }
      for (int u = 0; u < V[b].size(); u++) {
        V[a].push_back(V[b][u]);
      }
      X[b] = x;
      Y[b] = y;
      V[b].clear();
      V[b] = V[2];
    }
  }
  if (sqrt((X[0] - X[1]) * (X[0] - X[1]) + (Y[0] - Y[1]) * (Y[0] - Y[1])) <=
      1500000) {
    for (int i = 0; i < V[1].size(); i++) {
      P[V[1][i]] *= -1;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << P[i] << " ";
  }
  return 0;
}
