The seventh hokage, Naruto, has to do a lot of paperwork. It's taking a lot of time, so he has decided to do something interesting. He work can be divided into n tasks. He's is interested in knowing the minimum and maximum possible time required for a task. He has asked for your help. Your task is to calculate the sum of minimum and maximum possible time for a task, given the time for each task.

Input Format--

First line contains t, number of test cases.

First line of each case contains n, number of tasks.

Second line of each case contains time for each task, separated by spaces.

Output Format--

Output answer for each case in separate lines.

Constraints--

$1 \leq t \leq 100$

$1 \leq n \leq 10^5$

$1 \leq$time for a task $\leq 10^6$