#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

#define int long long
#define rep(i,n) for(int i = 0; i < (n); i++)
#define INF ((long long)1e18)
#define MOD ((int)1e9+7)
#define endl "\n"

#define yn(f) ((f)?"Yes":"No")
#define YN(f) ((f)?"YES":"NO")

#define MAX 110000

pair<double,double> least_squares_method(vector<pair<double, double>>& xy){
	double a, b;
	double covariance = 0, variance = 0, averageX = 0, averageY = 0;
	
	for(int i = 0; i < xy.size(); i++){
		averageX += xy[i].first;
		averageY += xy[i].second;
	}
	
	averageX /= xy.size();
	averageY /= xy.size();
	
	for(int i = 0; i < xy.size(); i++){
		covariance += (xy[i].first - averageX)*(xy[i].second - averageY);
		variance += (xy[i].first - averageX)*(xy[i].first - averageX);
	}
	
	a = covariance / variance;
	b = averageY - a * averageX;
	
	return make_pair(b,a);
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout<<fixed<<setprecision(10);
	
	int N, t;
	double cost = 0, b;
	vector<pair<double,double>> a;
	pair<double,double> ans;
	
	
	cin>>N;
	
	for(int i = 0; i < N; i++){
		cin>>t;
		a.push_back(make_pair(i,t));
	}
	
	ans = least_squares_method(a);
	
	b = ans.first;
	
	for(int i = 0; i < N; i++, b += ans.second){
		cost += (b - a[i].second) * (b - a[i].second);
	}
	
	cout<<ans.first<<" "<<ans.second<<endl;
	cout<<cost<<endl;
	return 0;
}