#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> vct_positive;
  vector<int> vct_negative;
  int elem;
  int size_n = n;
  while (n--) {
    cin >> elem;
    if (elem > 0) {
      vct_positive.push_back(elem);
    }
    if (elem < 0) {
      vct_negative.push_back(elem);
    }
  }
  if (vct_positive.size() < size_n / (2 * 1.0) &&
      vct_negative.size() < size_n / (2 * 1.0)) {
    cout << 0;
    return 0;
  }
  if (vct_positive.size() >= size_n / (2 * 1.0)) {
    cout << 1;
    return 0;
  }
  if (vct_negative.size() >= size_n / (2 * 1.0)) {
    cout << -1;
    return 0;
  }
  return 0;
}
