#include <bits/stdc++.h>
using namespace std;
long long modexp(long long x, long long n) {
  if (n == 0) {
    return 1;
  } else if (n & 1) {
    return (modexp((x * x) % 1000000007, n / 2) % 1000000007 * x % 1000000007) %
           1000000007;
  } else {
    return (modexp((x * x) % 1000000007, n / 2) % 1000000007);
  }
}
int main(int argc, char const *argv[]) {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long ncount = 0;
  long long zcount = 0;
  long long pcount = 0;
  for (long long i = 0; i < n; i++) {
    if (a[i] < 0) {
      ncount++;
    }
    if (a[i] == 0) {
      zcount++;
    }
    if (a[i] > 0) {
      pcount++;
    }
  }
  if ((n % 2) == 1) n++;
  if (pcount >= (n / 2)) {
    cout << 1 << endl;
  } else if (ncount >= (n / 2)) {
    cout << -1 << endl;
  } else {
    cout << 0 << endl;
  }
  return 0;
}
