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 JAVA):

Solution:
import java.io.*;
import java.util.StringTokenizer;

public class Q4 {
  public static void main(String[] args)throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        PrintWriter writer=new PrintWriter(System.out);
        int n=Integer.parseInt(br.readLine());
        StringTokenizer st=new StringTokenizer(br.readLine()," ");
        int[] a=new int[n];
        int s=0;
        for(int i=0;i<n;i++)
        {
         a[i]=Integer.parseInt(st.nextToken());
         s+=a[i];
        }
        if(s%2==1)
        {
            writer.println(0);
            writer.flush();
            System.exit(0);
        }
        boolean subset[][] = new boolean[2][s/2 + 1];
        for (int i = 0; i <= n; i++) {
            for (int j = 0; j <= s/2; j++) {
       
                // A subset with sum 0 is always possible 
                if (j == 0)
                    subset[i % 2][j] = true; 
       
                // If there exists no element no sum 
                // is possible 
                else if (i == 0)
                    subset[i % 2][j] = false; 
                else if (a[i - 1] <= j)
                    subset[i % 2][j] = subset[(i + 1) % 2]
                 [j - a[i - 1]] || subset[(i + 1) % 2][j];
                else
                    subset[i % 2][j] = subset[(i + 1) % 2][j];
            }
        }
        if(subset[n%2][s/2])
        {   
            int f=0;int no=0;
            for(int i=0;i<n;i++)
            {
                if(a[i]%2==1)
                {
                    no=i+1;
                    f=1;
                    break;
                }
            }
            if(f!=1)
            {
                while(f==0)
                {
                    for(int i=0;i<n;i++)
                    {
                        a[i]=a[i]/2;
                        if(a[i]%2==1)
                        {
                            f=1;
                            no=i+1;
                        }
                    }
                }
            }
            writer.println(1);
            writer.println(no);
        }
        else
         writer.print(0);
        writer.flush();
    }    
}