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
N = int(input())

n = str(input())

n = n.split()

# Convert to integers

L = []

for i in range(len(n)):
    L.append(int(n[i]))

# Obtain the parity of the first
# Compare the parity of the rest

# Case 1: the 2nd number is different
#   The 3rd number shall serve as jury
#       If the 1st parity = 3rd parity
#           Number 2 is the impostor
#       Else (if 1st != 3rd)
#           number 1 is the impostor

# Case 2: the nth number, where n > 2 is different
#   It is the impostor

# In the end, we retrieve this index as output

def parity(q):
    if (q % 2) == 0:    # 0 if even
        return 0
    else:               # 1 if odd
        return 1

for i in range(1,len(L)):
    if parity(L[0]) != parity(L[i]):
        if i == 1 :
            if parity(L[0]) == parity(L[i+1]):
                print(i+1)
                break
            else:
                print(1)
                break
        else:
            print(i+1)
            break