Problem: Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in the first is equal to the sum of the elements in the second. Now he wants to remove the minimum number of elements in a so that it becomes a good array. Can you help him?

A sequence b is a subsequence of an array a if b can be obtained from a by deleting some (possibly zero or all) elements. A partitioning of an array is a way to divide it into 2 subsequences such that every element belongs to exactly one subsequence, so you must use all the elements, and you can't share any elements.

Input

The first line contains an integer n (2 ≤ n ≤ 100) — the length of the array a.

The second line contains n integers a_1, a_2, …, a_{n} (1 ≤ a_i ≤ 2000) — the elements of the array a.

Output

The first line should contain the minimum number of elements you need to remove.

The second line should contain the indices of the elements you're removing, separated by spaces.

We can show that an answer always exists. If there are multiple solutions, you can print any.

Examples

Input


4
6 3 9 12


Output


1
2

Input


2
1 2


Output


0

Note

In the first example, you can partition the array into [6,9] and [3,12], so you must remove at least 1 element. Removing 3 is sufficient.

In the second example, the array is already good, so you don't need to remove any elements.

Solution (in PYTHON3):

Solution:
import random
import collections
import string
import math
import copy
import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)


def input(): return sys.stdin.readline().rstrip("\r\n")


# n = 0
# m = 0

# n = int(input())

# li = [int(i) for i in input().split()]

# s = sorted(li)
"""
from dataclasses import dataclass

@dataclass
class point:
    x: float
    y: float
 
 
@dataclass
class line:
    A: float
    B: float
    C: float
 
    def gety(self, x):
        return (self.A*x+self.C)/-self.B
    
    def getx(self, y):
        return (self.B*y+self.C)/-self.A
 
    def k(self):
        return -self.A/self.B
 
    def b(self):
        return -self.C/self.B
 
    def dist(self, p: point):
        return abs((self.A*p.x+self.B*p.y+self.C)/(self.A**2+self.B**2)**0.5)
 
 
def calc_line(u: point, v: point):
    return line(A=u.y-v.y, B=v.x-u.x, C=u.y*(u.x-v.x)-u.x*(u.y-v.y))
 
 
def is_parallel(u: line, v: line) -> bool:
    f1 = False
    f2 = False
    try:
        k1 = u.k()
    except:
        f1 = True
    try:
        k2 = v.k()
    except:
        f2 = True
    if f1 != f2:
        return False
    return f1 or k1 == k2
 
 
def seg_len(_from: point, _to: point):
    return ((_from.x - _to.x)**2 + (_from.y - _to.y)**2) ** 0.5
 
def in_range(_from: point, _to: point, _point: point) -> bool:
    if _from.x < _to.x:
        if _from.y < _to.y:
            return _from.x <= _point.x <= _to.x and _from.y <= _point.y <= _to.y
        else:
            return _from.x <= _point.x <= _to.x and _from.y >= _point.y >= _to.y
    else:
        if _from.y < _to.y:
            return _from.x >= _point.x >= _to.x and _from.y <= _point.y <= _to.y
        else:
            return _from.x >= _point.x >= _to.x and _from.y >= _point.y >= _to.y
 
def intersect(u: line, v: line) -> point:
    tx = (u.B*v.C-v.B*u.C)/(v.B*u.A-u.B*v.A)
    if u.B!=0.0:
        ty = -u.A*tx/u.B - u.C/u.B
    else:
        ty = -v.A*tx/v.B - v.C/v.B
    return point(x=tx, y=ty)
 
def in_direction(_from: point, _to: point, _point: point) -> bool:
    if _from.x < _to.x:
        if _from.y < _to.y:
            return _to.x < _point.x  and _to.y < _point.y
        else:
            return _to.x < _point.x  and _point.y <= _to.y
    else:
        if _from.y < _to.y:
            return _to.x >= _point.x  and _to.y < _point.y
        else:
            return _to.x >= _point.x  and _point.y <= _to.y


"""
# mo = int(1e9+7)
mo = 998244353


def exgcd(a, b):
    if not b:
        return 1, 0
    y, x = exgcd(b, a % b)
    y -= a//b * x
    return x, y


def getinv(a, m):
    x, y = exgcd(a, m)
    return -1 if x == 1 else x % m


def comb(n, b):
    res = 1
    b = min(b, n-b)
    for i in range(b):
        res = res*(n-i)*getinv(i+1, mo) % mo
        # res %= mo
    return res % mo


def quickpower(a, n):
    res = 1
    while n:
        if n & 1:
            res = res * a % mo
        n >>= 1
        a = a*a % mo
    return res


def dis(a, b):
    return abs(a[0]-b[0]) + abs(a[1]-b[1])


def getpref(x):
    if x > 1:
        return (x)*(x-1) >> 1
    else:
        return 0


def orafli(upp):
    primes = []
    marked = [False for i in range(upp+3)]
    prvs = [i for i in range(upp+3)]
    for i in range(2, upp):
        if not marked[i]:
            primes.append(i)
        for j in primes:
            if i*j >= upp:
                break
            marked[i*j] = True
            prvs[i*j] = j
            if i % j == 0:
                break
    return primes, prvs


def lower_ord(c: str) -> int:
    return ord(c)-97


def upper_ord(c: str) -> int:
    return ord(c) - 65


def read_list():
    return [int(i) for i in input().split()]


def read_int():
    s = input().split()
    if len(s) == 1:
        return int(s[0])
    else:
        return map(int, s)


def ask(s):
    print(f"? {s}", flush=True)


def answer(s):
    print(f"{s}", flush=True)

import functools

# primes, prvs = orafli(100010)

def solve():
    n = read_int()

    l = read_list()

    summ = sum(l)
    if summ&1:
        print(0)
        return

    vis = [0 for i in range(200010)]
    vis[0] = 1
    for i in range(n):
        for j in range(200001, -1, -1):
            if vis[j]:
                vis[l[i]+j] = 1
    if vis[summ>>1]!=1:
        print(0)
        return

    
    d = []
    while True:
        su = sum(l)
        flg = True
        if summ%2==1:
            break
        else:
            for p, i in enumerate(l):
                if i&1:
                    d.append(p+1)
                    flg = False
                    break
        if not flg:
            break
        for p, i in enumerate(l):
            l[p]>>=1
        # for
    print(len(d))
    print(*d)

    # def dfs(i, lis, su):
    #     if i == len(lis):
    #         d.add(su)
    #     else:
    #         dfs(i+1,lis,lis[i]+su)
    #         dfs(i+1,lis,su)

    # for p, j in enumerate(l):
    #     cd = set()
    #     for val in d:
    #         cd.add(val+j)
    #     if len(cd)!=1<<p or cd.intersection(d):
    #         sel = False
    #         break
    #     d = d.union(cd)
    # if sel:
    #     print(0)
    #     return

    # for i in d1:
    #     ll = list(l)
    #     ll.remove(i)
    #     sel = True
    #     d = {0}
    #     for p, j in enumerate(ll):
    #         cd = set()
    #         for val in d:
    #             cd.add(val+j)
    #         if len(cd)!=1<<p or cd.intersection(d):
    #             sel = False
    #             break
    #         d = d.union(cd)

    #     if sel:
    #         print(1)
    #         print(l.index(i)+1)
    #         return



    # while 1:
    #     if sum(l)&1:
    #         print(0)
    #         return
    #     for p, i in enumerate(l):
    #         if i&1:
    #             print(1)
    #             print(p+1)
    #             return
    #         l[p]>>=1
        # for p, i in enumerate

    # blm = [0 for i in range(12)]
    # for i in l:
    #     tl = []
    #     for p,j in enumerate(bl):
    #         blm[p]+=1 if j&i else 0
    # sel = -1
    # for k, v in enumerate(blm):
    #     if v&1:
    #         print(0)
    #         return
    #     if v and sel == -1:
    #         sel = k
    # vv = 1<<sel
    # for p, i in enumerate(l):
    #     if i&vv:
    #         print(1)
    #         print(p+1)
    #         return
    # print(blm)

    # d = {0}
    # dd = set(l)
    # flg = True
    # for i in d:
    #     for k in l:
    #         if k==i:
    #             if flg:
    #                 flg = True
    #                 continue
                
    #         cd = set()
    #         for j in d:
    #             cd.add(i+j)
    #         print(f"lencd{len(cd)}, lend{len(d)}")
    #         print(cd,d)
    #         # print()
    #         if len(cd)!=len(d) or len(cd.intersection(d)):
    #             print('WA!')
    #             break
    #         d = d.union(cd)
        


# fi = open('C:\\cppHeaders\\CF2020.12.17\\test.data', 'r')
# def input(): return fi.readline().rstrip("\r\n")
# primes, prv = orafli(10001)
# solve()
# t = int(input())


t = 1

for ti in range(t):
    # try:
    # print(f"Case #{ti+1}: ", end='')
    solve()
    # except:
        # traceback.print_exc()