#include <bits/stdc++.h>
using namespace std;
const int N = 101010;
pair<long long, long long> operator+(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return {a.first + b.first, a.second + b.second};
}
pair<long long, long long> operator-(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return {a.first - b.first, a.second - b.second};
}
long long sqr(long long x) { return x * x; }
long long norm(const pair<long long, long long>& a) {
  return sqr(a.first) + sqr(a.second);
}
void scan(pair<long long, long long>& tp) {
  scanf("%lld%lld", &tp.first, &tp.second);
}
int n, sgn[N], ord[N];
pair<long long, long long> p[N], cur;
const long long LIM = 1500000LL * 1500000LL;
void output() {
  for (int i = 0; i < n; i++) printf("%d%c", sgn[i], " \n"[i + 1 == n]);
  exit(0);
}
void go(int ptr) {
  if (ptr == n) {
    if (norm(cur) <= LIM) output();
    return;
  }
  int i = ord[ptr];
  int si = 1;
  if (norm(cur - p[i]) < norm(cur + p[i])) si = -1;
  for (int _ = 0; _ < 2; _++, si = -si) {
    sgn[i] = si;
    if (si == 1)
      cur = cur + p[i];
    else
      cur = cur - p[i];
    go(ptr + 1);
    if (si == 1)
      cur = cur - p[i];
    else
      cur = cur + p[i];
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scan(p[i]);
  for (int i = 0; i < n; i++) ord[i] = i;
  random_shuffle(ord, ord + n);
  go(0);
}
