Problem: You are given a sequence of n integers a1, a2, ..., an. 

Determine a real number x such that the weakness of the sequence a1 - x, a2 - x, ..., an - x is as small as possible.

The weakness of a sequence is defined as the maximum value of the poorness over all segments (contiguous subsequences) of a sequence.

The poorness of a segment is defined as the absolute value of sum of the elements of segment.

Input

The first line contains one integer n (1 ≤ n ≤ 200 000), the length of a sequence.

The second line contains n integers a1, a2, ..., an (|ai| ≤ 10 000).

Output

Output a real number denoting the minimum possible weakness of a1 - x, a2 - x, ..., an - x. Your answer will be considered correct if its relative or absolute error doesn't exceed 10 - 6.

Examples

Input

3
1 2 3


Output

1.000000000000000


Input

4
1 2 3 4


Output

2.000000000000000


Input

10
1 10 2 9 3 8 4 7 5 6


Output

4.500000000000000

Note

For the first case, the optimal value of x is 2 so the sequence becomes  - 1, 0, 1 and the max poorness occurs at the segment "-1" or segment "1". The poorness value (answer) equals to 1 in this case. 

For the second sample the optimal value of x is 2.5 so the sequence becomes  - 1.5, - 0.5, 0.5, 1.5 and the max poorness occurs on segment "-1.5 -0.5" or "0.5 1.5". The poorness value (answer) equals to 2 in this case.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000007, N = 100000, M = 1000;
int n;
double a[250000], d[250000];
double check(double sum) {
  for (int i = 1; i <= n; i++) d[i] = d[i - 1] + (a[i] - sum);
  double mini = 0, maxi = 0, ans = 0;
  for (int i = 1; i <= n; i++) {
    if (d[i] < 0.0)
      ans = max(ans, abs(d[i] - maxi));
    else
      ans = max(ans, abs(d[i] - mini));
    mini = min(mini, d[i]);
    maxi = max(maxi, d[i]);
  }
  return ans;
}
int main() {
  scanf("%d", &n);
  long double h2 = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%lf", &a[i]);
    h2 += a[i];
  }
  double ans = check(h2 / n);
  double l = -100001.0, r = 100001.0, EPS = 0.0000000001;
  while (r - l > EPS) {
    double m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
    ans = min(ans, check(m1));
    ans = min(ans, check(m2));
    if (check(m1) > check(m2))
      l = m1;
    else
      r = m2;
  }
  printf("%.9f", ans);
  return 0;
}