#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
struct jangvy{
int p1, p2, p3, p4, p5;
};
jangvy operator-(jangvy a, jangvy b){
jangvy c;
c.p1 = a.p1 - b.p1;
c.p2 = a.p2 - b.p2;
c.p3 = a.p3 - b.p3;
c.p4 = a.p4 - b.p4;
c.p5 = a.p5 - b.p5;
return c;
}
jangvy operator+(jangvy a, jangvy b){
jangvy c;
c.p1 = a.p1 + b.p1;
c.p2 = a.p2 + b.p2;
c.p3 = a.p3 + b.p3;
c.p4 = a.p4+ b.p4;
c.p5 = a.p5 + b.p5;
return c;
}
long long val(jangvy t){
return 1ll * t.p1 * (100 + t.p2) * ( 10000 - min(t.p3 * 100, 10000) + min(t.p3, 100) * t.p4 )* (100 + t.p5);
}
jangvy t[4];
int main(){
for(int i=0; i<4; i++){
int a,b,c,d,e;
scanf("%d %d %d %d %d",&a,&b,&c,&d,&e);
t[i] = (jangvy){a, b, c, d, e};
}
jangvy cur = t[0];
jangvy cur2 = t[1];
jangvy nxt = t[0] + t[3];
jangvy nxt2 = t[1] + t[2];
nxt = nxt - t[2];
nxt2 = nxt2 - t[3];
if((val(cur) - val(nxt))== 0){
puts("0");
}
else if(val(cur) > val(nxt)){
puts("-");
}
else{
puts("+");
}
cur = cur2;
nxt = nxt2;
if((val(cur) - val(nxt))== 0){
puts("0");
}
else if(val(cur) > val(nxt)){
puts("-");
}
else{
puts("+");
}
}
