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