#abc135a. [abc135_a]Harmony

[abc135_a]Harmony

Problem Statement

We have two distinct integers AA and BB.

Print the integer KK such that AK=BK|A - K| = |B - K|.

If such an integer does not exist, print IMPOSSIBLE instead.

Constraints

  • All values in input are integers.
  • 0leqA,Bleq1090 \\leq A,\\ B \\leq 10^9
  • AA and BB are distinct.

Input

Input is given from Standard Input in the following format:

AA BB

Output

Print the integer KK satisfying the condition.

If such an integer does not exist, print IMPOSSIBLE instead.


Sample Input 1

2 16

Sample Output 1

9

29=7|2 - 9| = 7 and 169=7|16 - 9| = 7, so 99 satisfies the condition.


Sample Input 2

0 3

Sample Output 2

IMPOSSIBLE

No integer satisfies the condition.


Sample Input 3

998244353 99824435

Sample Output 3

549034394