#include <iostream>
#include <vector>
 
using namespace std;
 
int largestSubarrayLength(vector<int>& arr) {
    int n = arr.size();
    int minSum = 0, currentSum = 0;
    int maxLength = 0;
 
    for (int i = 0; i < n; i++) {
        currentSum += arr[i];
        if (currentSum == minSum) {
            maxLength = max(maxLength, i + 1);
        } else if (currentSum < minSum) {
            minSum = currentSum;
            maxLength = i + 1;
        }
    }
 
    return maxLength;
}
 
int main() {
    int t;
    cin >> t;
 
    while (t--) {
        int n;
        cin >> n;
        vector<int> arr(n);
 
        for (int i = 0; i < n; i++) {
            cin >> arr[i];
        }
 
        cout << largestSubarrayLength(arr) << endl;
    }
 
    return 0;
}