In [10]:

    

import math


    

In [11]:

    

def find_solution(no_girls, no_boys):
    if no_girls == no_boys:
        return 1
    elif (no_girls > no_boys):
        return math.ceil((no_girls/(no_boys+1.0)))
    elif (no_girls < no_boys):
        return math.ceil((no_boys/(no_girls+1.0)))


    

In [ ]:

    

while True:
    int_arr = map(int, raw_input().split())
    
    no_girls = int_arr[0]
    no_boys = int_arr[1]
    
    if no_girls == 0 and no_boys == 0:
        print 0
    elif no_girls == -1 and no_boys == -1:
        break
    else:
        print int(find_solution(no_girls, no_boys))


    

    




999 88
12
12 22
2
666 223
3
100 1
50
0 0
0
1

In [ ]: