Between Enemy Lines

Author: Nazmul Alam

Your imaginary friend is stuck between two powerful enemy groups! 

If he is to escape, he must act very fast and choose a road number that is not yet infested with ferocious enemies. Unfortunately, he cannot be sure about the enemy's current position. But you can do that from your imaginary-powerful-able-to-hack-all  computer.

 So it's time to help your (imaginary) friend escape from (imaginary) enemies with the help of your (imaginary) super computer.

Input Format

The only input line contains two integers 1 < M < N < 1000, representing 2 road numbers where the enemies are.

Output Format

Print any road number in-between the enemy roads, as they are considered safe.


300 500
Language Time Memory
GNU C 11 1s 512MB
GNU C++ 14 1s 512MB
GNU C++ 11 1s 512MB
PHP 7 1s 1024MB
Java (OpenJDK 8) 1s 4096MB
Login To Submit