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?

## 1020: I think it

Time Limit: 1 Sec Memory Limit: 32 MBSubmit: 904 Solved: 131

[Submit][Status][Web Board]

## Description

## 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

한국어
中文
فارسی
English
ไทย

Anything about the Problems, Please Contact Admin:admin

All Copyright Reserved 2010-2014 HUSTOJ TEAM

GPL2.0 2003-2014 HUSTOJ Project TEAM

Help Maunal

Anything about the Problems, Please Contact Admin:admin

All Copyright Reserved 2010-2014 HUSTOJ TEAM

GPL2.0 2003-2014 HUSTOJ Project TEAM

Help Maunal