Cow College

Farmer John is planning to open a new university for cows. There are $N$ ($1 \le N \le 10^5$) cows who could potentially attend. Each cow is willing to pay a maximum tuition of $c_i$ ($1 \le c_i \le 10^6$). Farmer John sets one tuition that all cows must pay to enroll. If the tuition is higher than what a cow is willing to pay, that cow does not attend. Farmer John wants to earn as much money as possible so he can pay his instructors a fair wage. Find the maximum amount of money he can make and the tuition he should charge.

The first line contains $N$. The second line contains $N$ integers $c_1, c_2, \dots, c_N$, where $c_i$ is the maximum tuition cow $i$ is willing to pay.

Output the maximum amount of money Farmer John can make and the optimal tuition he should charge. If several solutions exist, output the one with the smallest optimal tuition. The numbers involved can be large, so you may need a 64-bit integer type.

If Farmer John charges $4$, then $3$ cows attend, so he makes $3 \cdot 4 = 12$.