import
java.io.*;
import
java.util.*;
class
GFG {
public
static
int
findValidIndex(
int
[] a,
int
n)
{
List<Integer> prefixEvenAverage
=
new
ArrayList<>(n);
List<Integer> suffixOddAverage =
new
ArrayList<>(n);
int
evenSum =
0
, evenAverage =
0
, evenLength =
0
,
oddSum =
0
, oddAverage =
0
, oddLength =
0
,
answer = -
1
;
for
(
int
i =
0
; i < n; i++) {
prefixEvenAverage.add(evenAverage);
if
(a[i] %
2
==
0
) {
evenSum += a[i];
evenLength++;
evenAverage = evenSum / evenLength;
}
}
for
(
int
i = n -
1
; i >=
0
; i--) {
suffixOddAverage.add(oddAverage);
if
(a[i] %
2
!=
0
) {
oddSum += a[i];
oddLength++;
oddAverage = oddSum / oddLength;
}
}
for
(
int
i =
1
; i < n -
1
; i++) {
if
(prefixEvenAverage.get(i)
> suffixOddAverage.get(i)) {
answer = i;
break
;
}
}
return
answer;
}
public
static
void
main(String[] args)
{
int
[] a = {
4
,
6
,
1
,
6
,
5
,
3
};
int
n = a.length;
System.out.println(findValidIndex(a, n));
}
}