#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n;
pair<int, int> a[maxn];
long long Max = 2250000000000;
vector<int> v;
void print() {
  for (auto i : v) cout << i << " ";
  exit(0);
}
map<pair<int, pair<int, int> >, bool> vis;
void first(int i, long long x, long long y) {
  if (i == n) {
    if (x * x + y * y <= Max) print();
    return;
  }
  if (vis[{i, {x, y}}]) return;
  vis[{i, {x, y}}] = true;
  if ((x - a[i].first) * (x - a[i].first) +
          (y - a[i].second) * (y - a[i].second) <=
      Max)
    v[i] = -1, first(i + 1, x - a[i].first, y - a[i].second);
  v[i] = 1, first(i + 1, x + a[i].first, y + a[i].second);
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  cin >> n;
  v.resize(n);
  for (int i = 0; i < n; ++i) cin >> a[i].first >> a[i].second;
  first(0, 0, 0);
  return 0;
}
