Minibuses#2206

Minibuses

1 second
122.174 megabytes
Very easy

At rush hour, three minibuses arrived at a stop at the same time, all following the same route, and quickly filled up with passengers. The drivers noticed that the number of passengers in each minibus was different. They decided to move some passengers among the minibuses so that each minibus would have the same number of passengers. Determine the minimum number of passengers that must be relocated.

Input

Three positive integers, each not exceeding , representing the number of passengers in the first, second, and third minibuses.

Output

Print a single number—the minimum number of passengers that need to be relocated. If it is not possible, print IMPOSSIBLE.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading