#include <bits/stdc++.h>
using namespace std;
struct Node {
  int id, tag;
  vector<Node*> child;
  Node(int);
};
Node::Node(int id) {
  this->id = id;
  this->tag = 1;
}
const int MAXN = 1e5 + 10, V = 1e6;
int n, x[MAXN], y[MAXN], ans[MAXN];
Node* nod[MAXN];
long long sqr(int x) { return (long long)x * x; }
Node* merge(Node* a, Node* b) {
  Node* c = new Node(0);
  c->child.push_back(a);
  c->child.push_back(b);
  return c;
}
void dfs(Node* a, int b) {
  b *= a->tag;
  if (a->id) ans[a->id] = b;
  for (vector<Node*>::iterator i = a->child.begin(); i < a->child.end(); i++) {
    dfs(*i, b);
  }
}
int main() {
  scanf("%d", &n);
  if (n == 1) {
    printf("1\n");
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &x[i], &y[i]);
    nod[i] = new Node(i);
  }
  for (int m = n; m > 2; m--) {
    if (sqr(x[m - 1] + x[m]) + sqr(y[m - 1] + y[m]) <= sqr(V)) {
      x[m - 1] += x[m], y[m - 1] += y[m];
      nod[m - 1] = merge(nod[m - 1], nod[m]);
    } else if (sqr(x[m - 1] - x[m]) + sqr(y[m - 1] - y[m]) <= sqr(V)) {
      x[m - 1] -= x[m], y[m - 1] -= y[m], nod[m]->tag = -1;
      nod[m - 1] = merge(nod[m - 1], nod[m]);
    } else if (sqr(x[m - 2] + x[m]) + sqr(y[m - 2] + y[m]) <= sqr(V)) {
      x[m - 2] += x[m], y[m - 2] += y[m];
      nod[m - 2] = merge(nod[m - 2], nod[m]);
    } else if (sqr(x[m - 2] - x[m]) + sqr(y[m - 2] - y[m]) <= sqr(V)) {
      x[m - 2] -= x[m], y[m - 2] -= y[m], nod[m]->tag = -1;
      nod[m - 2] = merge(nod[m - 2], nod[m]);
    } else if (sqr(x[m - 2] + x[m - 1]) + sqr(y[m - 2] + y[m - 1]) <= sqr(V)) {
      x[m - 2] += x[m - 1], y[m - 2] += y[m - 1];
      nod[m - 2] = merge(nod[m - 2], nod[m - 1]);
      x[m - 1] = x[m], y[m - 1] = y[m], nod[m - 1] = nod[m];
    } else {
      x[m - 2] -= x[m - 1], y[m - 2] -= y[m - 1], nod[m - 1]->tag = -1;
      nod[m - 2] = merge(nod[m - 2], nod[m - 1]);
      x[m - 1] = x[m], y[m - 1] = y[m], nod[m - 1] = nod[m];
    }
  }
  if (sqr(x[1] + x[2]) + sqr(y[1] + y[2]) <
      sqr(x[1] - x[2]) + sqr(y[1] - y[2])) {
    x[1] += x[2], y[1] += y[2];
    nod[1] = merge(nod[1], nod[2]);
  } else {
    x[1] -= x[2], y[1] -= y[2], nod[2]->tag = -1;
    nod[1] = merge(nod[1], nod[2]);
  }
  dfs(nod[1], 1);
  for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  printf("\n");
}
