import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void main() { try { for (; ; ) { const N = readInt(); auto A = new real[N]; foreach (i; 0 .. N) { A[i] = readReal(); } real cdd = 0.0, cdb = 0.0, cbb = 0.0, cd = 0.0, cb = 0.0; foreach (i; 0 .. N) { // ((d i + b) - A[i])^2 cdd += i^^2; cdb += 2.0 * i; cbb += 1.0; cd -= 2.0 * i * A[i]; cb -= 2.0 * A[i]; } /* [ 2 cdd cdb ] [ d ] [ -cd ] [ cdb 2 cbb ] [ b ] = [ -cb ] */ cdb /= 2.0; cd /= 2.0; cb /= 2.0; const denom = cdd * cbb - cdb^^2; const d = ((-cd) * cbb - cdb * (-cb)) / denom; const b = (cdd * (-cb) - (-cd) * cdb) / denom; real ans = 0.0; foreach (i; 0 .. N) { ans += ((d * i + b) - A[i])^^2; } writefln("%.10f %.10f", b, d); writefln("%.10f", ans); } } catch (EOFException e) { } }