100 atcoder#ABC135A. [ABC135A] Harmony

[ABC135A] Harmony

Score: 100100 points

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.
  • 0A, B1090 \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.

2 16
9

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

0 3
IMPOSSIBLE

No integer satisfies the condition.

998244353 99824435
549034394