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