99 100 100 100 100
 57 83 11 4 93
 99 99 99 99 99
 100 0 0 0 0
 0 1 2 3 4
 93 100 99 90 98
 87 38 19 33 100
 1 1 1 1 1
 0 0 0 0 1
 2 3 4 5 6
 1 2 1 2 3
 0 0 0 0 0
 100 100 100 100 100
 43 83 1 0 23
 43 83 1 100 23
 56 0 0 0 4
 99 98 98 99 100

-1
 -1
 99
 20
 2
 96
 -1
 1
 -1
 4
 -1
 -1
 100
 30
 50
 12
 -1

#include <bits/stdc++.h>
void radix_sort(int a[], int n) {
  int i, x[n + 1], m = 0, exp = 1;
  for (i = 1; i <= n; i++)
    if (a[i] > m) m = a[i];
  while (m / exp > 0) {
    int box[10] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
    for (i = 0; i < n; i++) box[a[i] / exp % 10]++;
    for (i = 1; i < 10; i++) box[i] += box[i - 1];
    for (i = n - 1; i >= 0; i--) {
      x[--box[a[i] / exp % 10]] = a[i];
    }
    for (i = 0; i < n; i++) {
      a[i] = x[i];
    }
    exp *= 10;
  }
}
int h[200];
int aa[5];
int main() {
  int t, w, i, m, p, j, s = 0, d;
  int n = 5;
  for (i = 0; i < n; i++) {
    scanf("%d", &aa[i]);
    s = s + aa[i];
  }
  if (s % 5 == 0 && s > 0)
    printf("%d", s / 5);
  else
    printf("-1");
  return 0;
}
