#include <iostream>

#include <algorithm>

using namespace std;

bool cmp(int a, int b){

return a >b;

}

int s(){

while (a[i]

}

int main (){

int i = 0, j =0, n, a[500000] ={0}, b[500000] = {0}, l, m;

while (cin >> n){

if (n > 0){

a[i]= n;

i++;

}

else {

b[j] = -n;

j++;

}

}

i += 1;

j += 1; 

sort (a, a + i, cmp);

sort (b, b + j);

n = 0;

if (b[0] > a[0]){

n++;

}

while (a[l] != 0 || b [m] != 0){

}

}