GIRLSNBS  Girls and Boys
There are G girl students and B boy students in a class that is about to graduate. You need to arrange them in a single row for the graduation. To give a better impression of diversity, you want to avoid having too many girls or too many boys seating consecutively. You decided to arrange the students in order to minimize the gender regularity. The gender regularity of an arrangement is the maximum number of students of the same gender (all girls or all boys) that appear consecutively. Given G and B, calculate the minimum gender regularity among all possible arrangements.
Input
Each test case is described using a single line. The line contains two integers G and B representing the number of girls and boys in the class, respectively (0 ≤ G, B ≤ 1000). The end of input is indicated with a line containing the number −1 twice.
Output
For each test case, output a single line with a single integer representing the minimum gender regularity that an arrangement of G girls and B boys can have.
Example
Input:
10 10
5 1
0 1000
1 1
Output:
1
3
1000
hide comments
Sivaraman Nagarajan:
20130224 03:52:47
Short and sweet problem 

stranger:
20121101 10:29:49
extremely easy. move to tutorial plz 

Charizard_:
20120903 17:21:19
Nice Prob....!!! 

mostafa hany:
20120815 22:27:19
easy and nice problem :) 

VV:
20120429 08:25:32
one of the shortest code i have written! 

dev:
20110129 08:38:52


M. Hilmil Muchtar A. P.:
20101117 08:10:59
I'am confused 
Added by:  Pablo Ariel Heiber 
Date:  20100927 
Time limit:  2s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 NODEJS OBJC VB.NET 
Resource:  FCEyN UBA ICPC Selection 2010 