#include <bits/stdc++.h>
using namespace std;
struct vec {
  int id;
  int x, y;
  long long lng;
  inline vec operator+(const vec& foo) {
    vec res;
    res.x = x + foo.x;
    res.y = y + foo.y;
    res.id = 0;
    return res;
  }
  inline vec operator-(const vec& foo) {
    vec res;
    res.x = x - foo.x;
    res.y = y - foo.y;
    res.id = 0;
    return res;
  }
  void calc_lng() { lng = (x * 1LL * x + y * 1LL * y); }
};
const int MX = 100000 + 5;
const long long MAX = 1500000 * 1LL * 1500000;
int color[MX];
int X[MX], Y[MX];
bool solve(int n, const vector<vec>& v) {
  vec all;
  all.x = 0;
  all.y = 0;
  int mult = 1;
  for (auto x : v) {
    vec One = all + x;
    vec Two = all - x;
    vec Three = x - all;
    One.calc_lng();
    Two.calc_lng();
    Three.calc_lng();
    if (One.lng <= Two.lng and One.lng <= Two.lng) {
      color[x.id] = +1 * mult;
      all = One;
    } else if (Two.lng <= One.lng and Two.lng <= Three.lng) {
      color[x.id] = -1 * mult;
      all = Two;
    } else if (Three.lng <= One.lng and Three.lng <= Two.lng) {
      mult *= -1;
      color[x.id] = mult;
      all = Three;
    }
  }
  all.calc_lng();
  if (all.lng > MAX) return false;
  for (int i = 0; i < n; i++) {
    printf("%d ", color[i] * mult);
  }
  printf("\n");
  return true;
}
int main() {
  int n;
  ignore = scanf("%d", &n);
  vector<vec> v;
  for (int i = 0; i < n; i++) {
    vec tmp;
    tmp.id = i;
    ignore = scanf("%d %d", &tmp.x, &tmp.y);
    v.push_back(tmp);
    X[i] = tmp.x;
    Y[i] = tmp.y;
  }
  while (true) {
    if (solve(n, v)) break;
    random_shuffle(v.begin(), v.end());
  }
}
