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;
const int maxn = 3e5 + 30;
int a[maxn];
int t, n;
int main() {
  scanf("%d", &t);
  while (t--) {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    a[0] = a[1], a[n + 1] = a[n];
    int max = 0, ans = -1;
    for (int i = 1; i <= n; ++i) {
      if (a[i] > max && (a[i] > a[i - 1] || a[i] > a[i + 1])) {
        ans = i;
        max = a[i];
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}
