#include <stdio.h>
int find_pattern(int *mem, int n) {
// Write your pointer-based logic here
if (n < 3) {
return -1;
}
int last = *mem;
int l = 0;
int r = 1;
mem++;
int consec = 0;
while (r < n) {
if (*mem != last + 1) {
l = r;
consec = 0;
} else {
consec++;
if (consec == 2) {
return l;
}
}
last = *(mem);
r++;
mem++;
}
return -1;
}
int main() {
int n, arr[100];
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int res = find_pattern(arr, n);
printf("%d", res);
return 0;
}