#include <stdio.h>
int find_pattern(int *mem, int n) {
// Write your pointer-based logic here
int pattern_index = -1;
int i = 0;
while (i < (n - 2)) {
if (*mem == (*(mem + 1) - 1) && *(mem + 1) == (*(mem + 2) - 1)) {
pattern_index = i;
break;
}
i++;
mem++;
}
return pattern_index;
}
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;
}