#include <bits/stdc++.h>
using namespace std;
const long long q = 1500000;
pair<int, int> a[100050];
int num[100050], n;
int fact[100050];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i].first >> a[i].second;
    num[i] = i;
  }
  long long ans = q * q;
  int qwe = n;
  while (1) {
    long long x = 0, y = 0;
    for (int i = 1; i <= n; ++i) {
      if ((x + a[i].first) * (x + a[i].first) +
              (y + a[i].second) * (y + a[i].second) >
          (x - a[i].first) * (x - a[i].first) +
              (y - a[i].second) * (y - a[i].second))
        x -= a[i].first, y -= a[i].second, fact[num[i]] = -1;
      else
        x += a[i].first, y += a[i].second, fact[num[i]] = 1;
    }
    if (x * x + y * y <= ans) {
      for (int i = 1; i <= n; i++) {
        cout << fact[i] << " ";
      }
      cout << "\n";
      return 0;
    }
    swap(a[2].second, a[qwe].second);
    swap(a[2].first, a[qwe].first);
    swap(num[2], num[qwe--]);
  }
  return 0;
}
