B"Joey is low on money. His friend Chandler wants to lend Joey some money, but can't give him directly, as Joey is too proud of himself to accept it. So, in order to trick him, Chandler asks Joey to play a game. In this game, Chandler gives Joey an array a_1, a_2, ... , a_n ( n geq 2 ) of positive integers ( a_i ge 1 ). Joey can perform the following operation on the array any number of times: In the end, Joey will get the money equal to the sum of elements of the final array. Find the maximum amount of money mathrm{ans} Joey can get but print 2022 cdot mathrm{ans} . Why multiplied by 2022 ? Because we are never gonna see it again! It is guaranteed that the product of all the elements of the array a doesn't exceed 10^{12} . Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= q t <= q 4000 ). Description of the test cases follows. The first line of each test case contains a single integer n ( 2 <= q n <= q 50 ) -- the length of the array a . The second line contains n integers a_1, a_2, ... , a_n ( 1 <= q a_i <= q 10^6 ) -- the array itself. It's guaranteed that the product of all a_i doesn't exceed 10^{12} (i. e. a_1 cdot a_2 cdot ldots cdot a_n <= 10^{12} ). For each test case, print the maximum money Joey can get multiplied by 2022 . In the first test case, Joey can do the following: "...