B'There are n pieces of cake on a line. The i -th piece of cake has weight a_i ( 1 <= q i <= q n ). The tastiness of the cake is the maximum total weight of two adjacent pieces of cake (i. e., max(a_1+a_2, , a_2+a_3, , ldots, , a_{n-1} + a_{n}) ). You want to maximize the tastiness of the cake. You are allowed to do the following operation at most once (doing more operations would ruin the cake): The subsegment a[l, r] of the array a is the sequence a_l, a_{l+1}, ... , a_r . If you reverse it, the array will become a_1, a_2, ... , a_{l-2}, a_{l-1}, underline{a_r}, underline{a_{r-1}}, underline{ ... }, underline{a_{l+1}}, underline{a_l}, a_{r+1}, a_{r+2}, ... , a_{n-1}, a_n . For example, if the weights are initially [5, 2, 1, 4, 7, 3] , you can reverse the subsegment a[2, 5] , getting [5, underline{7}, underline{4}, underline{1}, underline{2}, 3] . The tastiness of the cake is now 5 + 7 = 12 (while before the operation the tastiness was 4+7=11 ). Find the maximum tastiness of the cake after doing the operation at most once. The first line contains a single integer t ( 1 <= t <= 50 ) -- the number of test cases. The first line of each test case contains a single integer n ( 2 <= n <= 1000 ) -- the number of pieces of cake. The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= q a_i <= q 10^9 ) -- a_i is the weight of the i -th piece of cake. For each test case, print a single integer: the maximum tastiness of the cake after doing the operation at most once. In the first test case, after reversing the subsegment a[2, 5] , you get a cake with weights [5, underline{7}, underline{4}, underline{1}, underline{2}, 3] . The tastiness of the cake is now max(5+7, 7+4, 4+1, 1+2, 2+3) = 12 . This is the maximum possible tastiness of the cake one can obtain by performing the operati'...