B'You are given an array of n integers a_1,a_2, ... ,a_n . You have to create an array of n integers b_1,b_2, ... ,b_n such that: For example, if a=[1,-1,0,1] , then b=[-1,1,1,0] and b=[0,1,-1,1] are rearrangements of a , but b=[1,-1,-1,0] and b=[1,0,2,-3] are not rearrangements of a . If an array b_1,b_2, ... , b_n with the required properties does not exist, you have to print NO. Each test contains multiple test cases. The first line contains an integer t ( 1 <= t <= 1000 ) -- the number of test cases. The description of the test cases follows. The first line of each testcase contains one integer n ( 1 <= n <= 50 ) -- the length of the array a . The second line of each testcase contains n integers a_1,a_2, ... , a_n ( -50 <= a_i <= 50 ) -- the elements of a . For each testcase, if there is not an array b_1,b_2, ... ,b_n with the required properties, print a single line with the word NO. Otherwise print a line with the word YES, followed by a line with the n integers b_1,b_2, ... ,b_n . If there is more than one array b_1,b_2, ... ,b_n satisfying the required properties, you can print any of them. Explanation of the first testcase: An array with the desired properties is b=[1,-2,3,-4] . For this array, it holds: Explanation of the second testcase: Since all values in a are 0 , any rearrangement b of a will have all elements equal to 0 and therefore it clearly cannot satisfy the second property described in the statement (for example because b_1=0 ). Hence in this case the answer is NO. Explanation of the third testcase: An array with the desired properties is b=[1, 1, -1, 1, -1] . For this array, it holds: Explanation of the fourth testcase: An array with the desired properties is b=[-40,13,40,0,-9,-31] . For this array, it holds: '...