t=int(input())
for i in range (t):
n=int(input())
cnt=list(map(int,input().split()))
index=1
a=cnt[0]
for i in range (n):
if cnt[i]>a:
a=cnt[i]
index=i+1
print(index)#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int dt=86400;
#define pb push_back
#define ff first
#define ss second
const ll c=2022;
int main(){
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
// freopen("input.txt","r", stdin);
int t;cin>>t;
while(t--){
int n;cin>>n;
vector<pair<int,int>> cnt(n+1);
for(int i=1;i<=n;i++){
int x;cin>>x;
cnt[i]={x, i};
}
sort(cnt.begin()+1, cnt.end());
cout << cnt[n].second << endl;
}
return 0;
}
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |
Cyclic shifts | Zoos |
Build a graph | Almost correct bracket sequence |
Count of integers | Differences of the permutations |
Doctor's Secret | Back to School |
I am Easy | Teddy and Tweety |