#include <bits/stdc++.h>
using namespace std;
struct pt {
  long long x, y;
  pt() : x(), y() {}
  pt(long long _x, long long _y) : x(_x), y(_y){};
  pt operator+(const pt &p) const { return pt(x + p.x, y + p.y); }
  pt operator-(const pt &p) const { return pt(x - p.x, y - p.y); }
  pt operator*(const long long k) const { return pt(x * k, y * k); }
  long long sqr_len() const { return x * x + y * y; }
  void in() { cin >> x >> y; }
};
long long N = (long long)1e6 * (long long)1e6;
pt a[1 << 20];
pair<pt, int> cur[4];
queue<pair<pt, int> > q;
int sig[1 << 22];
int n;
vector<int> g[1 << 22];
void dfs(int u, int i) {
  for (int v : g[u]) {
    sig[v] *= i;
    dfs(v, sig[v]);
  }
}
long long s[2] = {1, -1};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) a[i].in();
  if (n == 1) {
    cout << "1\n";
    return 0;
  }
  for (int i = 0; i < n; i++) q.push(make_pair(a[i], i));
  int m = n;
  while (q.size() > 2) {
    for (int i = 0; i < 3; i++) {
      cur[i] = q.front();
      q.pop();
    }
    bool f = 0;
    for (int s1 = 0; s1 < 2 && !f; s1++)
      for (int s2 = 0; s2 < 2 && !f; s2++) {
        for (int i = 0; i < 3 && !f; i++)
          for (int j = 0; j < 3; j++) {
            if (i == j) continue;
            if (((cur[i].first * s[s1]) + (cur[j].first * s[s2])).sqr_len() <=
                N) {
              q.push(cur[i ^ j ^ 3]);
              sig[cur[i].second] = s[s1];
              sig[cur[j].second] = s[s2];
              g[m].push_back(cur[i].second);
              g[m].push_back(cur[j].second);
              q.push(make_pair(
                  ((cur[i].first * s[s1]) + (cur[j].first * s[s2])), m++));
              f = 1;
              break;
            }
          }
      }
  }
  for (int i = 0; i < 2; i++) cur[i] = q.front(), q.pop();
  bool f = 0;
  for (int i = 0; i < 2 && !f; i++)
    for (int j = 0; j < 2; j++) {
      if (i == j) continue;
      if ((cur[i].first + cur[j].first).sqr_len() * 2 <= 3 * N) {
        sig[cur[i].second] = 1;
        sig[cur[j].second] = 1;
        g[m].push_back(cur[i].second);
        g[m].push_back(cur[j].second);
        f = 1;
        break;
      } else if ((cur[i].first - cur[j].first).sqr_len() * 2 <= 3 * N) {
        sig[cur[i].second] = 1;
        sig[cur[j].second] = -1;
        g[m].push_back(cur[i].second);
        g[m].push_back(cur[j].second);
        f = 1;
        break;
      } else if (((cur[i].first * -1) + cur[j].first).sqr_len() <= 3 * N) {
        sig[cur[i].second] = -1;
        sig[cur[j].second] = 1;
        g[m].push_back(cur[i].second);
        g[m].push_back(cur[j].second);
        f = 1;
        break;
      } else if (((cur[i].first * -1) - cur[j].first).sqr_len() * 2 <= 3 * N) {
        sig[cur[i].second] = -1;
        sig[cur[j].second] = -1;
        g[m].push_back(cur[i].second);
        g[m].push_back(cur[j].second);
        f = 1;
        break;
      }
    }
  dfs(m, 1);
  for (int i = 0; i < n; i++) cout << sig[i] << " \n"[i == n - 1];
}
