#include <bits/stdc++.h>
using namespace std;
struct vec {
  long long x;
  long long y;
  int index;
  int verdict;
};
long long length(vec a) { return a.x * a.x + a.y * a.y; }
bool cmp(vec a, vec b) {
  if (length(a) < length(b)) return 0;
  if (length(a) > length(b)) return 1;
  if (a.index < b.index) return 1;
}
vec arr[100005];
int signs[100005];
int main() {
  cin.sync_with_stdio(false);
  cout.sync_with_stdio(false);
  long long sumX = 0, sumY = 0, N;
  scanf("%I64d", &N);
  for (int i = 0; i < N; ++i) {
    scanf("%I64d%I64d", &arr[i].x, &arr[i].y);
    arr[i].index = i;
  }
  while (1) {
    sumX = 0;
    sumY = 0;
    for (int i = 0; i < N; ++i) {
      vec plusSign;
      vec minusSign;
      plusSign.x = sumX + arr[i].x;
      plusSign.y = sumY + arr[i].y;
      minusSign.x = sumX - arr[i].x;
      minusSign.y = sumY - arr[i].y;
      if ((length(plusSign) < length(minusSign) && rand() % 10 < 8) ||
          (length(plusSign) >= length(minusSign) && rand() % 10 >= 8)) {
        arr[i].verdict = 1;
        sumX = sumX + arr[i].x;
        sumY = sumY + arr[i].y;
        signs[arr[i].index] = 1;
      } else {
        arr[i].verdict = -1;
        sumX = sumX - arr[i].x;
        sumY = sumY - arr[i].y;
        signs[arr[i].index] = -1;
      }
    }
    if (sqrt(sumX * sumX + sumY * sumY) < 1500000) break;
  }
  for (int i = 0; i < N; ++i) printf("%d ", signs[i]);
}
