#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3F3F3F3F;
const int MOD = 1e9 + 7;
const int MAX = 1e5 + 5;
int N;
pair<int, int> arr[2 * MAX];
vector<pair<int, int> > adj[2 * MAX];
vector<int> v = {1, 2};
int curr;
bool vis[2 * MAX];
int dist[2 * MAX];
inline long long int distSq(pair<int, int> v) {
  return (long long int)v.first * v.first + (long long int)v.second * v.second;
}
inline pair<int, int> add(pair<int, int> a, pair<int, int> b) {
  return {a.first + b.first, a.second + b.second};
}
inline pair<int, int> sub(pair<int, int> a, pair<int, int> b) {
  return {a.first - b.first, a.second - b.second};
}
inline bool check(pair<int, int> a, pair<int, int> b, bool plus, int lim) {
  if (!plus) {
    b.first = -b.first, b.second = -b.second;
  }
  return distSq(add(a, b)) <= (long long int)lim * lim;
}
inline void findVecs(int lim) {
  for (int i = 0; i < v.size(); i++) {
    for (int j = i + 1; j < v.size(); j++) {
      if (check(arr[v[i]], arr[v[j]], 0, lim)) {
        arr[curr] = sub(arr[v[i]], arr[v[j]]);
        adj[curr].push_back({v[i], 1}), adj[curr].push_back({v[j], -1});
        v.erase(v.begin() + j), v.erase(v.begin() + i);
        return;
      } else if (check(arr[v[i]], arr[v[j]], 1, lim)) {
        arr[curr] = add(arr[v[i]], arr[v[j]]);
        adj[curr].push_back({v[i], 1}), adj[curr].push_back({v[j], 1});
        v.erase(v.begin() + j), v.erase(v.begin() + i);
        return;
      }
    }
  }
}
void dfs(int u) {
  for (pair<int, int> e : adj[u]) {
    int v = e.first, w = e.second;
    if (!vis[v]) {
      vis[v] = 1;
      dist[v] = dist[u] * w;
      dfs(v);
    }
  }
}
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) {
    scanf("%d%d", &arr[i].first, &arr[i].second);
  }
  if (N == 1) {
    printf("1 ");
    return 0;
  }
  curr = N + 1;
  for (int i = 3; i <= N; i++) {
    v.push_back(i);
    findVecs(1e6);
    v.push_back(curr);
    curr++;
  }
  findVecs(1.5e6);
  fill(dist + 1, dist + curr + 1, 1);
  vis[curr] = 1;
  dfs(curr);
  for (int i = 1; i <= N; i++) {
    printf("%d ", dist[i]);
  }
  return 0;
}
