1
3
5 3 4
 6
5
5 3 4 4 5
3
1 1 1
5
4 4 3 4 4
5
5 5 4 3 2
3
1 1 2
5
5 4 3 5 5
 1
3
10 1 5

1
 1
-1
2
2
3
1
 1

#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) {
    int n, mx = -1;
    cin >> n;
    int arr[n];
    for (int i = 0; i < n; i++) {
      cin >> arr[i];
      mx = max(mx, arr[i]);
    }
    int ans = -1;
    for (int i = 1; i < n; i++)
      if (arr[i] == mx && arr[i - 1] != mx) ans = i + 1;
    for (int i = 0; i < n - 1; i++)
      if (arr[i] == mx && arr[i + 1] != mx) ans = i + 1;
    cout << ans << ("\n");
  }
  return 0;
}
