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