#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
struct mint {
  long long x;
  mint(long long x = 0) : x((x % 1000000007 + 1000000007) % 1000000007) {}
  mint &operator+=(const mint a) {
    if ((x += a.x) >= 1000000007) x -= 1000000007;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += 1000000007 - a.x) >= 1000000007) x -= 1000000007;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= 1000000007;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(long long t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(1000000007 - 2); }
  mint &operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
};
struct combination {
  vector<mint> fact, ifact;
  combination(int n) : fact(n + 1), ifact(n + 1) {
    assert(n < 1000000007);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 1;
    return fact[n] * ifact[k] * ifact[n - k];
  }
};
mint choose(int n, int a) {
  mint x, y;
  x = y = 1;
  for (long long p = 0; p < a; p++) {
    x *= n - p;
    y *= p + 1;
  }
  return x / y;
}
struct vec {
  long long x, y, z;
};
long long n;
vec v[150005];
vector<long long> res(150005);
long long up = 1500000;
bool check(long long x, long long y) {
  return (1LL * x * x + 1LL * y * y) <= up;
}
void dfs(long long node, long long x, long long y) {
  if (node > n) {
    for (long long p = 1; p < n + 1; p++) cout << res[p] << " ";
    exit(0);
  }
  if (check(x + v[node].x, y + v[node].y)) {
    res[v[node].z] = 1;
    dfs(node + 1, x + v[node].x, y + v[node].y);
  }
  if (check(x - v[node].x, y - v[node].y)) {
    res[v[node].z] = -1;
    dfs(node + 1, x - v[node].x, y - v[node].y);
  }
}
int main() {
  long long t, i, j, k, m, x, y, ans;
  t = 1;
  while (t--) {
    up = up * up;
    cin >> n;
    for (long long p = 1; p < n + 1; p++) {
      cin >> x >> y;
      v[p].x = x;
      v[p].y = y;
      v[p].z = p;
    }
    random_shuffle(v + 1, v + 1 + n);
    dfs(1, 0, 0);
  }
  return 0;
}
