Bob is preparing to pass IQ test. The most frequent task in this test is to find out which one of the given n numbers differs from the others. Bob observed that one number usually differs from the others in evenness. Help Bob — to check his answers, he needs a program that among the given n numbers finds one that is different in evenness.

Input

The first line contains integer n (3 ≤ n ≤ 100) — amount of numbers in the task. The second line contains n space-separated natural numbers, not exceeding 100. It is guaranteed, that exactly one of these numbers differs from the others in evenness.

Output

Output index of number that differs from the others in evenness. Numbers are numbered from 1 in the input order.

Examples

Input

5
2 4 7 8 10


Output

3


Input

4
1 2 1 1


Output

2
mylist = []
difference = 0

y = int(input())

        # Input des nombres sous forme de list int #
mylist = list(map(int,input("").strip().split()))

        # Compare le premier input avec la list #
if len(mylist) > y:
    difference = len(mylist) - y

        # Supprimer les éléments de la list en trop, s'il y en a #
if difference != 0:
    for z in range(0, difference):
        del mylist[len(mylist) - 1]


        # Fonction permettant de déterminer si: #
        # 1 nombre est pair et tous les autres impair, puis return le nombre pair #
        # 1 nombre est impair et tous les autres pair, puis return le nombre impair #
        # Sinon, return None #
def evenodd(mylist):
    impair = pair = 0
    for number in mylist:
        if number % 2 == 0:
            pair += 1
        else:
            impair += 1
    if impair == 1 and pair > 1:
        for number in mylist:
            if number % 2 != 0:
                return mylist.index(number) + 1
    elif pair == 1 and impair > 1:
        for number in mylist:
            if number % 2 == 0:
                return mylist.index(number) + 1


print(evenodd(mylist))
