A. Be Positive 【 Codeforces Round #542 [Alex Lopashev Thanks-Round] (Div. 2) 】

#include<bits/stdc++.h>
using namespace std;
 
int a[200];
int main()
{
    int n;
    int sum = 0;
    int num = 0;
    int cnt = 0;
    scanf("%d", &n);
    for(int i = 0; i < n; i ++)
    {
        scanf("%d", &a[i]);
        if(a[i] == 0) sum ++;
        if(a[i] < 0) num ++;
        if(a[i] > 0) cnt ++;
    }
    int m;
    if(n % 2 != 0) m = n / 2 + 1;
    else m = n / 2;
    if(sum > m ) printf("0\n");
    else {
        if(sum == m){
            if(n % 2 != 0) printf("0\n");
            else {
                if(num == 0)printf("1\n");
                else if(cnt == 0)printf("-1\n");
                else printf("0\n");
            }
        }
        else {
            if(num >= m) printf("-1\n");
            else if(cnt >= m) printf("1\n");
            else printf("0\n");
        }
    }
    return 0;
}