#include <stdio.h>
#include <limits.h>
 
#define MAXN 100000
 
int main() {
    int T;
    scanf("%d", &T);
 
    while (T--) {
        int n;
        scanf("%d", &n);
 
        int a[MAXN];
        for (int i = 0; i < n; i++) {
            scanf("%d", &a[i]);
        }
 
        // Find the minimum element in the array
        int min_element = INT_MAX;
        for (int i = 0; i < n; i++) {
            if (a[i] < min_element) {
                min_element = a[i];
            }
        }
 
        // Find the longest subarray with sum equal to the minimum element
        int max_len = 0;
        int current_sum = 0;
        int start = 0;
 
        for (int end = 0; end < n; end++) {
            current_sum += a[end];
 
            // If the current_sum equals the minimum element, update the max_len
            if (current_sum == min_element) {
                if (end - start + 1 > max_len) {
                    max_len = end - start + 1;
                }
            }
 
            // If current_sum exceeds min_element, reset the start and current_sum
            while (current_sum < min_element && start <= end) {
                current_sum -= a[start];
                start++;
            }
        }
 
        printf("%d\n", max_len);
    }
 
    return 0;
}