Source

This problem is adapted from Long Long OJ. All rights reserved.

Attention

The memory limit for this problem is 8 MB.

Problem Description

Given an integer sequence $\{a_n\}$ of length $n$, find the floating-point number pair $(x, y)$ that minimizes the value of:

Input Format

The first line contains a positive integer $n$.

The second line contains $n$ integers $\{a_n\}$.

Output Format

Output a single line with two floating-point numbers $x$ and $y$, with a relative or absolute error within $10^{-3}$.

It can be proven that the optimal $(x, y)$ is unique.

Samples

20
-1711 5271 1865 -7326 7975 -4709 5564 5578 -121 -8285 -10084 902 3610 -4082 -8018 6737 6038 -621 5880 -958

-121.971429 31.286466

Data Range

The first test case is the sample.

For $100\%$ of the test cases, $1 \le n \le 10^6$, $-10^9 \le a_i \le 10^9$.