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
 import java.util.*;
 import java.lang.*;
 import java.io.*;
 
 /* Name of the class has to be "Main" only if the class is public. */
 public class A_IQ_test
 {
     static int M = 1_000_000_007;
     static final PrintWriter out =new PrintWriter(System.out);
     static final FastReader fs = new FastReader();
     public static void main (String[] args) throws java.lang.Exception
     {
           
          
               int n=fs.nextInt();
               int a[]=new int[n];
               a=fs.arrayIn(n);
               int in=-1;
               int inn=-1;
               int ev=0;
               int od=0;
               for(int j=0;j<n;j++){
                   if(a[j]%2==0){
                       ev++;
                       in=j+1;
                   }else{
                       od++;
                       inn=j+1;
                   }
               }
               if(ev==1)
               out.println(in);
               else
               out.println(inn);
           
           out.flush();
  }
         static class FastReader 
         {
         BufferedReader br;
         StringTokenizer st;
  
         public FastReader()
         {
             br = new BufferedReader(
                 new InputStreamReader(System.in));
         }
  
         String next()
         {
             while (st == null || !st.hasMoreElements()) {
                 try {
                     st = new StringTokenizer(br.readLine());
                     }
                 catch (IOException e) {
                     e.printStackTrace();
                     }
         }
             return st.nextToken();
         }
  
         int nextInt() { return Integer.parseInt(next()); }
  
         long nextLong() { return Long.parseLong(next()); }
  
         double nextDouble()
         {
             return Double.parseDouble(next());
         }
  
         String nextLine()
         {
             String str = "";
             try {
                 str = br.readLine();
             }
             catch (IOException e) {
                 e.printStackTrace();
             }
             return str;
         }
 int [] arrayIn(int n) throws IOException
     {
         int  arr[] = new int[n];
         for(int i=0; i<n; i++)
         {
             arr[i] = nextInt();
         }
         return arr;
     }
     }
     
     public static class Pairs implements Comparable<Pairs>
     {
         int value,index;
         Pairs(int value, int index)
         {
             this.value = value;
             this.index = index;
         }
         public int compareTo(Pairs p)
         {
             return Integer.compare(this.value, p.value);
         }
     }
     static final Random random = new Random();
  
     static void ruffleSort(int arr[])
     {
         int n = arr.length;
         for(int i=0; i<n; i++)
         {
             int j = random.nextInt(n),temp = arr[j];
             arr[j] = arr[i];
             arr[i] = temp;
         }
         Arrays.sort(arr);
     }
     static long nCk(int n, int k) {
         return (modMult(fact(n),fastexp(modMult(fact(n-k),fact(k)),M-2)));
     }
  
     static long fact (long n) {
  
         long fact =1;
         for(int i=1; i<=n; i++) {
             fact = modMult(fact,i);
         }
         return fact%M;
     }
  
     static long modMult(long a,long b) {
         return a*b%M;
     }
  
     static long fastexp(long x, int y){
         if(y==1) return x;
  
         long ans = fastexp(x,y/2);
         if(y%2 == 0) return modMult(ans,ans);
         else return modMult(ans,modMult(ans,x));
     }
 }