#include <cstdio>
#include <bitset>
#include <algorithm>

using namespace std;

bitset <2000000005> enc;
int v[5005],sub[5005]={},N,startpos,endpos;
int main()
{
	freopen("secv.in","r",stdin);
	freopen("secv.out","w",stdout);

	scanf("%d",&N);
	for(int i=1;i<=N;i++)
	{
		scanf("%d",&v[i]);
		if(!enc[v[i]])
		{
			sub[++sub[0]]=v[i];
			enc[v[i]]=1;
		}
	}
	sort(sub+1,sub+sub[0]+1);
	int x=1;
	for(int i=1;i<=N;i++)
	{
		if(x>sub[0])
			break;
		if(sub[x]==v[i])
		{
			if(x==1)
				startpos=i;
			if(x==sub[0])
				endpos=i;
			x++;
		}
	}
	printf("%d",endpos-startpos+1);
	return 0;
}