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;
long long int n, m, x, k;
double a[200005];
double f(double x) {
  double max_subarray_sum_1 = 0;
  double max_subarray_sum_2 = 0;
  double cur1 = 0;
  double cur2 = 0;
  for (long long int i = 0; i < n; i++) {
    cur1 += (a[i] - x);
    cur2 -= (a[i] - x);
    if (cur1 > max_subarray_sum_1) max_subarray_sum_1 = cur1;
    if (cur2 > max_subarray_sum_2) max_subarray_sum_2 = cur2;
    if (cur1 < 0) cur1 = 0;
    if (cur2 < 0) cur2 = 0;
  }
  return max(max_subarray_sum_1, max_subarray_sum_2);
}
double ternary_search_minima(double l, double r) {
  long long int iterations = 300;
  while (iterations--) {
    double m1 = l + (r - l) / 3.0;
    double m2 = r - (r - l) / 3.0;
    if (f(m1) < f(m2))
      r = m2;
    else
      l = m1;
  }
  return f(l);
}
void purple() {
  cin >> n;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  double l = -100000000000.0, r = 100000000000.0;
  printf("%.8lf\n", ternary_search_minima(l, r));
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long int t = 1;
  while (t--) purple();
}