#include <bits/stdc++.h>
using namespace std;
const long long BIG = 1000000000000000000LL;
void cpr(string s, vector<long long> v) {
  long long i = 0;
  for (char c : s) {
    if (c == '$')
      cout << v[i++];
    else
      cout << c;
  }
  cout << '\n';
}
void cpr(string s) { cpr(s, {}); }
void solve();
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
const long long borne = (long long)(1e5) + 5;
vector<pair<pair<long long, long long>, long long> > quad[4];
vector<long long> rf[borne];
void rajouter(pair<pair<long long, long long>, long long> infos) {
  long long k1 = (infos.first.first > 0);
  long long k2 = (infos.first.second > 0);
  k2 *= 2;
  quad[k1 | k2].push_back(infos);
}
void fusion(long long a, long long b) {
  auto tp1 = quad[a].back();
  quad[a].pop_back();
  auto tp2 = quad[b].back();
  quad[b].pop_back();
  if (rf[tp1.second].size() < rf[tp2.second].size()) swap(tp1, tp2);
  long long c = 1;
  if (a == b) {
    c *= -1;
  }
  tp1.first.first += c * tp2.first.first;
  tp1.first.second += c * tp2.first.second;
  for (auto x : rf[tp2.second]) rf[tp1.second].push_back(c * x);
  rajouter(tp1);
}
long long nbVec;
void solve() {
  cin >> nbVec;
  for (long long i = (0); i < (nbVec); ++i) {
    long long x, y;
    cin >> x >> y;
    pair<pair<long long, long long>, long long> info = {{x, y}, i + 1};
    rf[i + 1].push_back(i + 1);
    rajouter(info);
  }
  bool b = true;
  long long x = nbVec;
  while (b) {
    b = false;
    for (long long i = (0); i < (4); ++i) {
      if (quad[i].size() >= 2U) {
        fusion(i, i);
        --x;
        b = true;
      }
      long long j = i ^ 3;
      if (!(quad[i].empty() || quad[j].empty())) {
        fusion(i, j);
        --x;
        b = true;
      }
    }
  }
  vector<long long> ans(nbVec);
  for (long long bm = (0); bm < (35); ++bm) {
    long long dx = 0, dy = 0;
    for (long long i = (0); i < (4); ++i) {
      if (!quad[i].empty()) {
        auto x = quad[i].back();
        long long c = 1;
        if (bm & (1 << i)) c = -1;
        dx += c * x.first.first;
        dy += c * x.first.second;
        vector<long long> &cibles = rf[x.second];
        assert(!cibles.empty());
        for (long long o : cibles) {
          ans[abs(o) - 1] = abs(o) / o;
          ans[abs(o) - 1] *= c;
        }
      }
    }
    double dd = sqrt(dx * dx + dy * dy);
    if (dd <= 1.4 * (double)(1e6)) break;
  }
  for (long long i = (0); i < (nbVec); ++i) cout << ans[i] << " ";
  cout << "\n";
}
