#include "bits/stdc++.h"

#define REP(i, n, N) for(ll i=(n); i<(N); i++)
#define RREP(i, n, N) for(ll i=(N-1); i>=n; i--)
#define CK(n, a, b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define MCP(a, b) memcpy(b,a,sizeof(b))
#define p(s) cout<<(s)<<endl
#define p2(a, b) cout<<(a)<<" "<<(b)<<endl
#define v2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll mod = 1e9 + 7;
const ll inf = 1e18;

int N;
int a[2010];
double b,d;

double dist(double b0, double mid){
    double diff=0;
    REP(i,0,N){
        diff += (b0 + i*mid - a[i]) * (b0 + i*mid - a[i]);
    }
    return diff;
}
double search(double mid){
    double lb=-1e9,ub=1e9;
    double mid1, mid2;
    REP(i,0,100){
        mid1 = (lb*2 +ub) / 3.;
        mid2 = (lb + ub*2) / 3.;
        if(dist(mid, mid1) >= dist(mid, mid2)) lb = mid1;
        else ub=mid2;
    }
    d = mid1;
    return dist(mid, mid1);
}
int main() {
    cin>>N;
    REP(i,0,N) cin>>a[i];
    REP(i,0,N-1){
        d += a[i+1] - a[i];
    }
    d /= (N-1);
    double lb=-1e9,ub=1e9;
    double mid1, mid2;
    REP(i,0,100){
        mid1 = (lb*2 +ub) / 3.;
        mid2 = (lb + ub*2) / 3.;
        if(search(mid1) >= search(mid2)) lb = mid1;
        else ub=mid2;
    }
    b = mid1;
    double dist = search(b);
    printf("%.7lf %.7lf\n", b, d);
    printf("%.7lf\n", dist);
    return 0;
}