You are given an array \(a\) (\(a_{1} , a_{2} , a_{3}......a_{n}\)) you have to find the largest subarray length whose sum is the minimum number in the array \(a\).

Subarray:  Subarray is the contiguous element of an array.

The first line contains single integer \(T\)(\(1\leq T \leq 10\)) which represents the number of test cases.
Each test case consists of two lines. First line contains an integer \(n\) \((1\leq n\leq 10^5)\) and second line will contain an array \(a\) \((-10^5\leq a_{i}\leq 0)\)of n integers.
 

you have to print the largest subarray length whose sum is the minimum number in array a.
 

Input copy	Output copy
2 5 -5 0 0 -3 -2 7 -1 0 0 0 0 -1 -1	4 5

Test Case Explanation:  In the first test case there are six possible subarrays whose sum is the minimum number.

and the six possible subarrays are:

1. Index 1 to 1 [-5].
2. Index 1 to 2 [-5,0].
3. Index 1 to 3 [-5,0,0].
4. Index 4 to 5 [-3,-2].
5. Index 3 to 5 [0,-3,-2].
6. Index 2 to 5 [0,0,-3,-2].

So subarray from Index 2 to Index 5 is the answer as it has the highest length 4.