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--) {
    int n, mx = -1;
    cin >> n;
    vector<int> vec;
    for (int i = 0; i < n; ++i) {
      int num;
      cin >> num;
      vec.push_back(num);
      mx = max(mx, num);
    }
    int idx = -1;
    for (int i = 0; i < n; ++i) {
      if (vec[i] != mx) continue;
      if (i > 0 && vec[i - 1] < mx) idx = i + 1;
      if (i < n - 1 && vec[i + 1] < mx) idx = i + 1;
    }
    cout << idx << endl;
  }
  return 0;
}
