#include "bits/stdc++.h"
using namespace std;
#define vec vector

typedef set<int> si;
typedef vec<int> vi;
#define endl 			  '\n'
//#define int               long long
#define rep(i,a,b)        for(int i=a;i<b;i++)
#define ld                long double
#define pb                push_back
#define mp 				  make_pair
#define mem0(a)           memset(a,0,sizeof(a))
#define X                 <<" " 
#define XX                
#define ppb               pop_back
#define rev(i,a,b)        for(int i=a;i>b;i--)
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define uniq(v)           (v).erase(unique(all(v)),(v).end())
#define sz(x)             (int)((x).size())
#define fr                first
#define sc                second
#define pii               pair<int,int>
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define ppc               __builtin_popcount
#define ppcll             __builtin_popcountll
const int P=1e9+7;
typedef priority_queue <int> pqi;
typedef priority_queue <int, vector<int>, greater<int> > mpqi;
typedef set<int>::iterator sit;	
typedef vector<int>::iterator vit;
typedef vec<long double> vd;
typedef vec<string> vs;
typedef multiset <int> msi;
typedef map <int,int> mii;
typedef pair<int, int> parii;
typedef pair<int, string> paris;
typedef vector<parii> vpii;
typedef vector<paris> vpis;
typedef set<char> ss;
const int N=15001;
/*******************************************************************************/


void solve(){
	int n;cin>>n;int p,ans;
	int a[n];cin>>a[0]>>a[1]>>a[2];
	if(a[0]==a[1]){
		p=a[0];
		if(a[0]!=a[2]){ans=3;}
		rep(i,3,n){
			cin>>a[i];
			if(a[i]!=p){ans=i+1;}
			else continue;
		}
	}
	else if(a[0]==a[2]){ans=2;rep(i,3,n) cin>>a[i];}
	else{ans =1;rep(i,3,n) cin>>a[i];}
	
	cout<<ans<<endl;
}



/***************************************************************************/
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
#ifdef SIEVE
	sieve();
#endif

int tc=1;
cin>>tc;	
while(tc--) solve();	
return 0;
}





### 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"
using namespace std;
#define vec vector

typedef set<int> si;
typedef vec<int> vi;
#define endl 			  '\n'
//#define int               long long
#define rep(i,a,b)        for(int i=a;i<b;i++)
#define ld                long double
#define pb                push_back
#define mp 				  make_pair
#define mem0(a)           memset(a,0,sizeof(a))
#define X                 <<" " 
#define XX                
#define ppb               pop_back
#define rev(i,a,b)        for(int i=a;i>b;i--)
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define uniq(v)           (v).erase(unique(all(v)),(v).end())
#define sz(x)             (int)((x).size())
#define fr                first
#define sc                second
#define pii               pair<int,int>
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define ppc               __builtin_popcount
#define ppcll             __builtin_popcountll
const int P=1e9+7;
typedef priority_queue <int> pqi;
typedef priority_queue <int, vector<int>, greater<int> > mpqi;
typedef set<int>::iterator sit;	
typedef vector<int>::iterator vit;
typedef vec<long double> vd;
typedef vec<string> vs;
typedef multiset <int> msi;
typedef map <int,int> mii;
typedef pair<int, int> parii;
typedef pair<int, string> paris;
typedef vector<parii> vpii;
typedef vector<paris> vpis;
typedef set<char> ss;
const int N=15001;
/*******************************************************************************/


void solve(){
	int n;cin>>n;int p,ans;
	int a[n];cin>>a[0]>>a[1]>>a[2];
	if(a[0]==a[1]){
		p=a[0];
		if(a[0]!=a[2]){ans=3;}
		rep(i,3,n){
			cin>>a[i];
			if(a[i]!=p){ans=i+1;}
			else continue;
		}
	}
	else if(a[0]==a[2]){ans=2;rep(i,3,n) cin>>a[i];}
	else{ans =1;rep(i,3,n) cin>>a[i];}
	
	cout<<ans<<endl;
}



/***************************************************************************/
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
#ifdef SIEVE
	sieve();
#endif

int tc=1;
cin>>tc;	
while(tc--) solve();	
return 0;
}





```