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