Codeforces-273（div2） A. Initial Bet

A. Initial Bet

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

The input consists of a single line containing five integers c1, c2, c3, c4 and c5 — the number of coins that the first, second, third, fourth and fifth players respectively have at the end of the game (0 ≤ c1, c2, c3, c4, c5 ≤ 100).

Output

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).

Sample test(s)

input

2 5 4 0 4

output

3

input

4 5 9 2 1

output

-1

Note

In the first sample the following sequence of operations is possible:

1. One coin is passed from the fourth player to the second player;
2. One coin is passed from the fourth player to the fifth player;
3. One coin is passed from the first player to the third player;
4. One coin is passed from the fourth player to the second player.

题意：有五个人，每人初始有b个币，然后两个人进行打赌，然后输的人把一个币给赢的人。这样重复进行，最后给你c1，c2，c3，c4，c5分别代表5个人最后剩下的币数，让你求是否存在b满足此情况，存在b则输出b，不存在就输出“-1”。

做法：其实只要判断这五个数的和是否被5整除即可，但要注意不能为0（因为0没考虑wa1发。。），满足整除的情况输出sum/5即可，不满足输出-1。

#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include<map>
#include <algorithm>
#include<ctime>
#define esp 1e-6
#define LL unsigned long long
#define inf 0x0f0f0f0f
using namespace std;
int main()
{
	int a,b,c,d,e;
	while(scanf("%d%d%d%d%d",&a,&b,&c,&d,&e)!=EOF)
	{
		int ans=0;
		ans=a+b+c+d+e;
		if(ans%5==0&&ans!=0)
		printf("%d\n",ans/5);
		else
		printf("-1\n");
	}
	return 0;	
}