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() {
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long maxx = 0, m = 1, arr[n], arr1[n], j = 0;
    for (int i = 0; i < n; i++) {
      cin >> arr[i];
      if (arr[i] == arr[i - 1] and i > 0) {
        m++;
      }
      maxx = max(arr[i], maxx);
    }
    if (m == n) {
      cout << -1 << '\n';
    } else {
      for (int i = 0; i < n; i++) {
        if (i == 0 and arr[i] == maxx and arr[i] > arr[i + 1]) {
          cout << i + 1 << '\n';
          break;
        } else if (i < n - 1 and arr[i] == maxx and arr[i] > arr[i + 1]) {
          cout << i + 1 << '\n';
          break;
        } else if (i < n - 1 and arr[i] == maxx and arr[i] > arr[i - 1]) {
          cout << i - 1 << '\n';
          break;
        } else if (i == n - 1 and arr[i] == maxx and arr[i] > arr[i - 1]) {
          cout << i - 1 << '\n';
          break;
        }
      }
    }
  }
}
