OJ系统新功能测试中,如有问题请联系 15864441230 17853533775 15684102985 17853533719 尽量不要在上课时间打电话

Problem 1020. -- I think it

1020: I think it

Time Limit: 1 Sec  Memory Limit: 32 MB
Submit: 710  Solved: 92
[Submit][Status][Web Board]

Description

Xiao Ming is only seven years old, Now I give him some numbers, and ask him what is the second largest sum if he can choose a part of them. For example, if I give him 1 、 2 、 3 , then he should tell me 5 as 6 is the largest and 5 is the second. I think it is too hard for him, isn ’ t it?

Input

Standard input will contain multiple test cases. The first line of the input is a single integer T (1 <= T <=10) which is the number of test cases. And it will be followed by T consecutive test cases.
Each test case starts with a line containing an integer N (1<N<10) , the number I give Xiao Ming . The second line contains N Integer numbers ai (-10<ai<10),

Output

For each test case, output the answer.

Sample Input

2
3
1 2 3
4
0 1 2 3

Sample Output

5
5

HINT

Source

[Submit][Status][Web Board]