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;
double inp[200005];
int n;
double solve() {
  double ret = 0;
  double sum = 0;
  priority_queue<double, vector<double>, greater<double> > q;
  q.push(0);
  for (int i = 0; i < n; i++) {
    sum += inp[i];
    q.push(sum);
    ret = max(ret, sum - q.top());
  }
  return ret;
}
int main() {
  cin >> n;
  double sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> inp[i];
    sum += inp[i];
  }
  double mean = sum * 1.0 / n;
  for (int i = 0; i < n; i++) inp[i] = inp[i] - mean;
  double ans = 1e15;
  ans = min(ans, solve());
  for (int i = 0; i < n; i++) inp[i] = -inp[i];
  ans = min(ans, solve());
  printf("%.10lf\n", ans);
  return 0;
}
