|Codeforces Round #273 (Div. 2)|
There are five people playing a game called "Generosity". Each person gives some non-zero number of coins b as an initial bet. After all players make their bets of b coins, the following operation is repeated for several times: a coin is passed from one player to some other player.
Your task is to write a program that can, given the number of coins each player has at the end of the game, determine the size b of the initial bet or find out that such outcome of the game cannot be obtained for any positive number of coins b in the initial bet.
The input consists of a single line containing five integers c 1, c 2, c 3, c 4 and c 5 — the number of coins that the first, second, third, fourth and fifth players respectively have at the end of the game (0 ≤ c 1, c 2, c 3, c 4, c 5 ≤ 100).
Print the only line containing a single positive integer b — the number of coins in the initial bet of each player. If there is no such value of b, then print the only value "-1" (quotes for clarity).
2 5 4 0 4
4 5 9 2 1
In the first sample the following sequence of operations is possible: