#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const long long int oo = numeric_limits<long long int>::max();
const long long int BOUND = 1.5e6;
const long long int SQ_BOUND = BOUND * BOUND;
inline long long int norm_sq(const complex<long long int> &z) {
  return (z * conj(z)).real();
}
int n;
long long int s[N];
complex<long long int> o, arr[N];
int run() {
  long long int mn = oo;
  int opt = -1;
  for (int i = 1; i <= n; ++i) {
    s[i] = -s[i];
    complex<long long int> aux = o + 2 * s[i] * arr[i];
    if (norm_sq(aux) < mn) {
      mn = norm_sq(aux);
      opt = i;
    }
    s[i] = -s[i];
  }
  return opt;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    int x, y;
    cin >> x >> y;
    arr[i] = {x, y};
  }
  bool success;
  while (1) {
    o = {0, 0};
    for (int i = 1; i <= n; ++i) {
      s[i] = (rand() & 1) ? 1 : -1;
      o += s[i] * arr[i];
    }
    success = true;
    while (norm_sq(o) > SQ_BOUND) {
      int opt = run();
      if (!~opt) {
        success = false;
        break;
      }
      s[opt] = -s[opt];
      o += 2 * s[opt] * arr[opt];
    }
    if (success) {
      for (int j = 1; j <= n; j++) cout << s[j] << " \n"[j == n];
      break;
    }
  }
  assert(success);
  return 0;
}
