Time Limit: 1 s
Memory Limit: 32 MB

Submission：480
AC：45
Score：96.17

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 (at least one). 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?

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),

For each test case, output the answer.

input

2
3
1 2 3
4
0 1 2 3

output

5
5