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
Rahul Chaurasia:
20151031 15:09:24
so easy


mdsharique:
20151009 18:36:38
my first problem AC in one go......... 

nonushikhar:
20151002 21:15:07
ac in one go! :) 

Shyam singh:
20150919 11:35:34
simplest one...AC in one go ... ;P 

coder_shishir:
20150831 13:30:24
easy one...take care of : G=0, B=0; 

Yuvak Patel:
20150804 14:56:12
AC in first go,easy one!!


uptoyou:
20150626 06:32:49
i don't understand the problem ._. if you don't mind, explain please, thanks :D


hareesh:
20150518 16:40:21
AC in first go :) 

vagesh_verma:
20150515 17:44:28
so eassyyyy 

kamran siddique:
20150407 08:53:33
Thanks vikki

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 