A. IQ test

A. IQ test

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Sample test(s)

input

5
2 4 7 8 10

output

3

input

4
1 2 1 1

output

2

/* ***********************************************
Author        :
Created Time  :2015/6/12 14:48:26
File Name     :7.cpp
************************************************ */
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define mod 90001
#define INF 1<<30
#define maxn 10000+10
#define cle(a) memset(a,0,sizeof(a))
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;

bool cmp(int a,int b){
    return a>b;
}
int main()
{
    #ifndef ONLINE_JUDGE
    //freopen("in.txt","r",stdin);
    #endif
    //freopen("out.txt","w",stdout);
    int n;
	while(cin>>n){
		int index1=0,index2=0;
		int a;
		int cnt1=0,cnt2=0;
		for(int i=1;i<=n;i++){
			cin>>a;
			if(a&1){
				if(index1==0)index1=i;
				cnt1++;
			}
			else {
				cnt2++;
				if(index2==0)index2=i;
			}
		}
		if(cnt1<cnt2)cout<<index1<<endl;
		else cout<<index2<<endl;
	}
    return 0;
}