10
-405 -230 252 -393 -390 -259 97 163 81 -129
 3
10000 -10000 10000
 1
-10000
 20
-16 -23 29 44 -40 -50 -41 34 -38 30 -12 28 -44 -49 15 50 -28 38 -2 0

702.333333333333712
 10000.000000000016371
 0.000000000000000
 113.875000000000043

#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, -1, 1};
const int N = 200000;
double v[N];
int n;
double aux[N];
double esc;
double nv[N];
int main() {
  scanf("%d", &n);
  double sum = 0;
  for (int i = 0; i < n; ++i) {
    scanf("%lf", v + i);
    aux[i] = v[i];
    sum += v[i];
  }
  sort(aux, aux + n);
  esc = sum / (double)n;
  for (int i = 0; i < n; ++i) nv[i] = v[i] - esc;
  double maxisum = 0.;
  double parc = 0.;
  for (int i = 0; i < n; ++i) {
    parc += nv[i];
    if (parc < 0.) parc = 0.;
    maxisum = max(maxisum, parc);
  }
  parc = 0.;
  for (int i = 0; i < n; ++i) nv[i] *= -1.;
  for (int i = 0; i < n; ++i) {
    parc += nv[i];
    if (parc < 0.) parc = 0.;
    maxisum = max(maxisum, parc);
  }
  printf("%.15lf\n", maxisum);
  return 0;
}
