B"Guy-Manuel and Thomas have an array a of n integers [ a_1, a_2, ... , a_n ]. In one step they can add 1 to any element of the array. Formally, in one step they can choose any integer index i ( 1 <= i <= n ) and do a_i := a_i + 1 . If either the sum or the product of all elements in the array is equal to zero, Guy-Manuel and Thomas do not mind to do this operation one more time. What is the minimum number of steps they need to do to make both the sum and the product of all elements in the array different from zero? Formally, find the minimum number of steps to make a_1 + a_2 + ... + a_n ne 0 and a_1 cdot a_2 cdot ... cdot a_n ne 0 . Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^3 ). The description of the test cases follows. The first line of each test case contains an integer n ( 1 <= n <= 100 ) -- the size of the array. The second line of each test case contains n integers a_1, a_2, ... , a_n ( -100 <= a_i <= 100 ) -- elements of the array . For each test case, output the minimum number of steps required to make both sum and product of all elements in the array different from zero. In the first test case, the sum is 0 . If we add 1 to the first element, the array will be [3,-1,-1] , the sum will be equal to 1 and the product will be equal to 3 . In the second test case, both product and sum are 0 . If we add 1 to the second and the third element, the array will be [-1,1,1,1] , the sum will be equal to 2 and the product will be equal to -1 . It can be shown that fewer steps can't be enough. In the third test case, both sum and product are non-zero, we don't need to do anything. In the fourth test case, after adding 1 twice to the first element the array will be [2,-2,1] , the sum will be 1 and the "...