0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-27 06:31:57 +00:00
OI-codes/problem/CF25A/CF25A.cpp
2020-10-22 21:52:13 +08:00

23 lines
416 B
C++

#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[5], t, o;
cin >> n >> a[0] >> a[1] >> a[2];
o = (a[0] % 2 + a[1] % 2 + a[2] % 2) / 2;
for (int i = 0; i < n; i++) {
if (i >= 3) {
cin >> t;
}
else {
t = a[i];
}
if (t % 2 != o) {
cout << i+1 << endl;
return 0;
}
}
return 0;
}