/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll INF = 1e18;

using matrix = vector<V>;
struct Matrix
{
    static const int maxn = 105;
    ll A[maxn][maxn];
    int n;

    Matrix(int n_) : n(n_)
    {
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < n; ++j)
                A[i][j] = 0;
    }

    Matrix operator*(const Matrix &o) const
    {
        Matrix ret(n);
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < n; ++j)
                for (int k = 0; k < n; ++k)
                {
                    ll c = A[i][k] * o.A[k][j] % mod;
                    ret.A[i][j] = (ret.A[i][j] + c) % mod;
                }
        return ret;
    }

    static Matrix identity(int n)
    {
        Matrix ret(n);
        for (int i = 0; i < n; ++i)
            ret.A[i][i] = 1;
        return ret;
    }

    Matrix operator^(long long k) const
    {
        Matrix ret = identity(n);
        Matrix a = *this;
        while (k)
        {
            if (k & 1)
                ret = ret * a;
            a = a * a;
            k /= 2;
        }
        return ret;
    }
};
void lsm(vector<ld> x, vector<ld> y, int N, long double *a0, long double *a1)
{
    int i;
    double A00 = 0, A01 = 0, A02 = 0, A11 = 0, A12 = 0;

    for (i = 0; i < N; i++)
    {
        A00 += 1.0;
        A01 += x[i];
        A02 += y[i];
        A11 += x[i] * x[i];
        A12 += x[i] * y[i];
    }

    *a0 = (A02 * A11 - A01 * A12) / (A00 * A11 - A01 * A01);
    *a1 = (A00 * A12 - A01 * A02) / (A00 * A11 - A01 * A01);
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    cin>>n;
    vector<ld> vec(n);
    rep(i, n) cin >> vec[i];
    vector<ld> vec2(n);
    rep(i, n) vec2[i] = i;
    ld x = 0;
    ld y=0;
    lsm(vec2,vec,n,&x,&y);
    cout <<setprecision(20)<< x << " " << y << endl;
    ld res=0;
    rep(i,n){
        res+=pow(((x+y*i)-vec[i]),2);
    }
    cout<<res<<endl;
}