#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define int long long
#define pii pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<vector<int>>
#define vpii vector<pair<int, int>>
#define ff first
#define ss second
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
const int inf = 1e9 + 5;

void solve()
{
    int n;
    cin >> n;
    vpii a(n);
    for (int i = 0; i < n; i++)
    {
        int x, y;
        cin >> x;
        a[i] = {x, i + 1};
    }
    sort(a.begin(), a.end());
    if (a[0].ff != a[1].ff)
        cout << a[0].ss << endl;
    else
    {
        cout << a[n - 1].ss << endl;
    }
    return;
}

int32_t main()
{
    fast;
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}
### Prompt

In cpp, your task is to solve the following problem:

You are given an array a consisting of n (n ≥ 3) positive integers. It is known that in this array, all the numbers except one are the same (for example, in the array [4, 11, 4, 4] all numbers except one are equal to 4).

Print the index of the element that does not equal others. The numbers in the array are numbered from one.

Input

The first line contains a single integer t (1 ≤ t ≤ 100). Then t test cases follow.

The first line of each test case contains a single integer n (3 ≤ n ≤ 100) — the length of the array a.

The second line of each test case contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 100).

It is guaranteed that all the numbers except one in the a array are the same.

Output

For each test case, output a single integer — the index of the element that is not equal to others.

Example

Input


4
4
11 13 11 11
5
1 4 4 4 4
10
3 3 3 3 10 3 3 3 3 3
3
20 20 10


Output


2
1
5
3

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define int long long
#define pii pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<vector<int>>
#define vpii vector<pair<int, int>>
#define ff first
#define ss second
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
const int inf = 1e9 + 5;

void solve()
{
    int n;
    cin >> n;
    vpii a(n);
    for (int i = 0; i < n; i++)
    {
        int x, y;
        cin >> x;
        a[i] = {x, i + 1};
    }
    sort(a.begin(), a.end());
    if (a[0].ff != a[1].ff)
        cout << a[0].ss << endl;
    else
    {
        cout << a[n - 1].ss << endl;
    }
    return;
}

int32_t main()
{
    fast;
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}
```