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