#include <cstdio>
#include <algorithm>
const int NMAX = 5001;

bool bit(char b[], int x, int c = 2)
{
	if (c == 2)
		return b[x >> 3] & 1 << (x & 7);
	else if (c) {
		b[x >> 3] |= 1 << (x & 7);
		return true;
	}
	else {
		b[x >> 3] &= ~(1 << (x & 7));
		return false;
	}
}

int main()
{
	int N, i, unic[NMAX], sir[NMAX], k = 0, sz;
	int left, right;
	char bset[(NMAX >> 3) + 2] = {};
	
	freopen("secv.in", "r", stdin);
	freopen("secv.out", "w", stdout);
	scanf("%d\n", &N);
	for (i = 0; i != N; ++i) {
		scanf("%d ", sir + i);
		if (!bit(bset, sir[i])) {
			bit(bset, sir[i], 1);
			unic[k++] = sir[i];
		}
	}
	std::sort(unic, unic + k);
	sz = k;
	for (i = k = 0; i != N; ++i)
		if (sir[i] == unic[k]) {
			++k;
			if (k == 1) left = i;
			right = i;
		}
	if (k != sz) {
		printf("-1\n");
		return 0;
	}
	for (i = right - 1, k -= 2; ; --i) {
		if (sir[i] == unic[k]) --k;
		if (k == -1 || i == left) break;
	}
	left = i;
	printf("%d\n", right - left + 1);
		
	return 0;
}