NOI 3.5 哈希 1551: Sumsets

题目来源：http://noi.openjudge.cn/ch0305/1551/

1551: Sumsets

总时间限制: 1000ms    内存限制: 65536kB

描述

Given S, a set of integers, find the largest d such that a + b +c = d where a, b, c, and d are distinct elements of S.

输入

Several S, each consisting of a line containing an integer 1<= n <= 1000 indicating the number of elements in S, followed by theelements of S, one per line. Each element of S is a distinct integer between-536870912 and +536870911 inclusive. The last line of input contains 0.

输出

For each S, a single line containing d, or a single linecontaining "no solution".

样例输入

5
2
3
5
7
12
5
2
16
64
256
1024
0