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 tst;
  cin >> tst;
  while (tst--) {
    int n;
    cin >> n;
    long long int arr[n];
    bool f = false;
    for (int i = 0; i < n; i++) {
      cin >> arr[i];
      if (arr[i] != arr[i - 1] && i > 0) f = true;
    }
    if (!f)
      cout << -1 << "\n";
    else {
      long long int mx = *max_element(arr, arr + n);
      for (int i = 0; i < n; i++) {
        if (arr[i] == mx && ((arr[i] != arr[i + 1] && i < n - 1) ||
                             (arr[i] != arr[i - 1] && i > 0))) {
          cout << i + 1 << "\n";
          break;
        }
      }
    }
  }
  return 0;
}
