Spy Detected Problem !!!

 PROBLEM 35: Spy Detected!

Problem Reference: Codeforces

You are given an array a$a$ consisting of n$n$ (n≥3$n\ge 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]$[4,11,4,4]$ all numbers except one are equal to 4$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$t$ (1≤t≤100$1\le t\le 100$). Then t$t$ test cases follow.

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

The second line of each test case contains n$n$ integers a1,a2,…,an$a_1,a_2,\dots ,a_n$ (1≤ai≤100$1\le a_i\le 100$).

It is guaranteed that all the numbers except one in the a$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.

Solution: 

1. t = int(input())
2. i = 0
3. while i < t:
4. n = int(input())
5. a = [int(a) for a in input().split()]
6. j = 1
7. while j <= len(a):
8. if a[j] == a[j-1]:
9. j = j + 1
10. else:
11. break
12. if j == 1 and a[j] == a[j+1]:
13. print(j)
14. else:
15. print(j+1)
16. i = i + 1

The above solution is in python langauge

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