#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
#define deb(x) cout<<x<<"\n";
#define disp(x) cout<<x.first<<" "<<x.second<<"\n";
using namespace std;
const int MOD=1000000007;
const int MOD2=15000007;
const ll MAX=9187201950435737471;
const int N=100005;
const int M=100005;
const int INF=2;
const double EPS=1e-9;
const long double PI=acos(-1);

int cmp(int a,int b){
    return a>b;
}


ll po(ll x,ll y){
    //x%=MOD;
    ll ret=1;
    while(y>0){
        if(y&1){
            ret=(ret*x);//%MOD;
        }
        y=y>>1ll;
        x=(x*x);
    }
    return ret;
}


void solve(int T){
    int n;
    cin>>n;
    vector<int>a(n);
    map<int,int>mp;
    int ans=0;
    for(int i=0;i<n;i++){
        cin>>a[i];
        mp[a[i]]++;
    }
    for(int i=0;i<n;i++){
        if(mp[a[i]]==1)ans=i+1;
    }
    cout<<ans<<"\n";
}

int main(){
    //freopen("","r",stdin);
    //freopen("output.txt","w",stdout);
    fastio
    int T=1;
    cin>>T;
    for(int i=1;i<=T;i++){
        solve(i);
        //if(i<T)cout<<"\n";
    }
    return 0;
}

/*

3
1 -2 3

*/

### Prompt

Develop a solution in Cpp to the problem described below:

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>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
#define deb(x) cout<<x<<"\n";
#define disp(x) cout<<x.first<<" "<<x.second<<"\n";
using namespace std;
const int MOD=1000000007;
const int MOD2=15000007;
const ll MAX=9187201950435737471;
const int N=100005;
const int M=100005;
const int INF=2;
const double EPS=1e-9;
const long double PI=acos(-1);

int cmp(int a,int b){
    return a>b;
}


ll po(ll x,ll y){
    //x%=MOD;
    ll ret=1;
    while(y>0){
        if(y&1){
            ret=(ret*x);//%MOD;
        }
        y=y>>1ll;
        x=(x*x);
    }
    return ret;
}


void solve(int T){
    int n;
    cin>>n;
    vector<int>a(n);
    map<int,int>mp;
    int ans=0;
    for(int i=0;i<n;i++){
        cin>>a[i];
        mp[a[i]]++;
    }
    for(int i=0;i<n;i++){
        if(mp[a[i]]==1)ans=i+1;
    }
    cout<<ans<<"\n";
}

int main(){
    //freopen("","r",stdin);
    //freopen("output.txt","w",stdout);
    fastio
    int T=1;
    cin>>T;
    for(int i=1;i<=T;i++){
        solve(i);
        //if(i<T)cout<<"\n";
    }
    return 0;
}

/*

3
1 -2 3

*/

```