-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA IQ Test.cpp
55 lines (52 loc) · 1.45 KB
/
A IQ Test.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
//////////////// ANAS IBN BELAL /////////////////
// Test Case Less Template ||
// ||
// ||
// BANGLADESH UNIVERSITY OF BUSINESS AND TECHNOLOGY ||
// INTAKE 52 ||
// DEPARTMENT OF CSE ||
// ||
//||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <set>
#include <queue>
#include <map>
#include <deque>
#include <list>
#include <limits.h>
#define ll long long
#define endl "\n"
using namespace std;
void Fast_io()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int main()
{
Fast_io();
int x, count = 0, sum = 0, idx_1, idx_2;
cin >> x;
vector<ll> a(x);
for (int i = 1; i <= x; i++)
{
cin >> a[i];
if (a[i] % 2 == 0)
{
count++;
idx_1 = i;
}
else
{
sum++;
idx_2 = i;
}
}
(count < sum) ? cout << idx_1 << endl : cout << idx_2 << endl;
return 0;
}