#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,n,m) for(int i=(n);i<(m);i++)
#define REP(i,n) FOR(i,0,n)
#define REPR(i,n) for(int i=(n);i>=0;i--)
#define all(vec) vec.begin(),vec.end()
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<int,int>;
using PP=pair<int,P>;
using Pl=pair<ll,ll>;
using PPl=pair<ll,Pl>;
using vs=vector<string>;
#define fi first
#define se second
#define pb push_back
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
const ll MOD=1000000007LL;
const int INF=1<<30;
const ll LINF=1LL<<60;
using dP=pair<double,double>;
double g(const vector<double>& vec,double a,double b){
    double res=0;
    REP(i,vec.size()){
        res+=pow(vec[i]-(a*i+b),2);
    }
    return res;
}
const double lb=-1e8,ub=1e8;
const int N=300;
dP f(const vector<double>& vec,double x){
    double l=lb,r=ub;
    REP(_,N){
        double a=(l*2+r)/3;
        double b=(l+r*2)/3;
        double p=g(vec,x,a);
        double q=g(vec,x,b);
        if(p>q){
            l=a;
        }else{
            r=b;
        }
    }
    return make_pair(g(vec,x,l),l);
}
int main(){
    int n;
    cin>>n;
    vector<double> vec(n);
    REP(i,n){
        cin>>vec[i];
    }
    double l=lb,r=ub;
    REP(_,N){
        double a=(l*2+r)/3;
        double b=(l+r*2)/3;
        dP p=f(vec,a);
        dP q=f(vec,b);
        if(p>q){
            l=a;
        }else{
            r=b;
        }
    }
    dP ans=f(vec,l);
    cout<<fixed<<setprecision(10)<<ans.se<<" "<<l<<endl<<ans.fi<<endl;
    return 0;
}