#include <bits/stdc++.h>
using namespace std;
const long long p = 2250000000000ll;
const long long N = 100005;
long long n;
long long dir[N];
long long a[2][N];
long long flag = 0;
void dp(long long in, long long x, long long y) {
  if (in == n + 1 && x * x + y * y <= p) flag = 1;
  if (in == n + 1 && !flag) return;
  if (flag == 1) {
    for (long long i = 1; i <= n; i++) cout << dir[i] << ' ';
    exit(0);
  }
  long long ax = x - a[0][in];
  long long ay = y - a[1][in];
  long long bx = x + a[0][in];
  long long by = y + a[1][in];
  if (ax * ax + ay * ay < bx * bx + by * by) {
    dir[in] = -1;
    dp(in + 1, x - a[0][in], y - a[1][in]);
    dir[in] = 1;
    dp(in + 1, x + a[0][in], y + a[1][in]);
  } else {
    dir[in] = 1;
    dp(in + 1, x + a[0][in], y + a[1][in]);
    dir[in] = -1;
    dp(in + 1, x - a[0][in], y - a[1][in]);
  }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> a[0][i] >> a[1][i];
  dp(1, 0, 0);
  for (long long i = 1; i <= n; i++) cout << dir[i] << ' ';
  return 0;
}
