Bob is preparing to pass IQ test. The most frequent task in this test is `to find out which one of the given 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 numbers finds one that is different in evenness, and return a position of this number.

`!` Keep in mind that your task is to help Bob solve a `real IQ test`, which means indexes of the elements start from `1 (not 0)`

##Examples :

 
```python
iq_test("2 4 7 8 10") => 3 // Third number is odd, while the rest of the numbers are even

iq_test("1 2 1 1") => 2 // Second number is even, while the rest of the numbers are odd
```

Difficulty: introductory

Starter code:

def iq_test(numbers):
	

Solutions:
def iq_test(numbers):
    e = [int(i) % 2 == 0 for i in numbers.split()]

    return e.index(True) + 1 if e.count(True) == 1 else e.index(False) + 1


def iq_test(n):
    n = [int(i)%2 for i in n.split()]
    if n.count(0)>1:
        return n.index(1)+1
    else:
        return n.index(0)+1


def iq_test(numbers):
    indexEven = 0
    indexOdd = 0
    numEven = 0
    numOdd = 0
    nums = numbers.split(" ")
    for i in range(len(nums)):
        if int(nums[i])%2 == 0:
            numEven += 1
            indexEven = i+1
        else:
            numOdd += 1
            indexOdd = i+1
    if numEven == 1:
        return indexEven
    else:
        return indexOdd

def iq_test(numbers):
    eo = [int(n)%2 for n in numbers.split()]
    return eo.index(1 if eo.count(0)>1 else 0)+1

def iq_test(numbers):
    nums = map(int, numbers.split(" "))
    evens, odds = 0, 0
    for i, n  in enumerate(nums):
        if n % 2 == 0:
            evens += 1
            ei = i
        else:
            odds += 1
            oi = i
    
    if evens == 1:
        return ei + 1
    return oi + 1

def iq_test(numbers):
  digits = [int(x) for x in numbers.split()]
  even = [x % 2 for x in digits]
  if sum(even) == 1:
    return even.index(1) + 1
  else:
    return even.index(0) + 1


def iq_test(numbers):
    nums = [int(n) % 2 for n in numbers.split()]
    if sum(nums) == 1:
        return nums.index(1) + 1
    else:
        return nums.index(0) + 1

def iq_test(numbers):
  a=list(map(lambda x : int(x)%2,numbers.split(' ')))
  return 1+(a.index(0) if (a.count(0)) == 1 else a.index(1))

def iq_test(numbers):
    all=numbers.split(" ")
    odd=[int(x) for x in all if int(x)%2!=0]
    even=[int(x) for x in all if int(x)%2==0]
    if len(odd)==1:
        return all.index(str(odd[0]))+1
    return all.index(str(even[0]))+1

def iq_test(numbers):
    even, odd = [], []
    new_nums = numbers.split()
    for index, num in enumerate(new_nums,1):
        if int(num) % 2 == 0:
            even.append(index)
        else:
            odd.append(index)
      
    if len(even) > len(odd):
        return int(odd[0])
    else:
        return int(even[0])