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;
const int N = 200010;
int a[N];
int b[N];
double d[N];
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) b[i] = a[i];
  sort(b + 1, b + n + 1);
  double med;
  if (n & 1)
    med = b[(n / 2) + 1];
  else
    med = (b[n / 2] + b[(n / 2) + 1]) * 0.5;
  for (int i = 1; i <= n; i++) d[i] = a[i] - med;
  double maxi = 0, mini = 0;
  for (int i = 1; i <= n; i++) {
    d[i] = d[i] + d[i - 1];
    maxi = max(maxi, d[i]);
    mini = min(mini, d[i]);
  }
  maxi -= mini;
  printf("%.13f\n", maxi);
}
