#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
using namespace std;
bool isprime(long long n) {
  if (n % 2 == 0) {
    return false;
  }
  for (auto i = 3; i * i <= n; i += 2) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
long long digitsum(long long n) {
  long long sum = 0;
  while (n > 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
int main() {
  int n, cm = 0, cp = 0, x;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x;
    if (x > 0)
      cp++;
    else if (x < 0)
      cm++;
  }
  if (cp >= n + 1 >> 1)
    cout << 1;
  else if (cm >= n + 1 >> 1)
    cout << -1;
  else
    cout << 0;
}
