#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
#define double long double

int n,a[1111];

double calc(double m,double s) {
  double k=(double)(n-1)/2;
  double cost=0;
  rep(i,n) {
    cost+=(((double)i-k)*m+s-a[i])*(((double)i-k)*m+s-a[i]);
  }
  return cost;
}

void Main() {
  cin >> n;
  rep(i,n) cin >> a[i];
  double s=0;
  rep(i,n) s+=a[i];
  s/=n;
  double l=-1000000,r=1000000;
  rep(t,500) {
    double m1=(l*2+r)/3,m2=(l+r*2)/3;
    double d1=calc(m1,s),d2=calc(m2,s);
    if(d1>d2) l=m1;
    else r=m2;
  }
  printf("%.10Lf %.10Lf\n",(-(n-1)/2)*l+s,l);
  printf("%.10Lf\n",calc(l,s));
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}