**Problem Description**

Please find a way to cost minimum power and kill all monsters.

**Input**

The first line of input is the number of testcases T.

The first line of each testcase contains a integer N : the number of monsters

Then a line contains N integers : The i-th number represent the HP of i-th monster.

T <= 10

1<= n <= 100000

1<= a_i <= 1000000

**Output**

For each testcase, output a integer to represent the answer.

It is guaranteed that answer is not out of int range.

**Sample Input**

2 2 1 2 3 5 1 1

**Sample Output**

3 5

**Source**

2019绍兴市计算机技能竞赛