#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int v[5005];
bool f[5005];
int main()
{
    freopen("secv.in","r",stdin);
    freopen("secv.out","w",stdout);
    vector<int>a;
    int n , i ,cnt = 0;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        a.push_back(v[i]);
    }
    sort(a.begin(),a.end());
    vector<int>::iterator it;
    it=a.begin();
    int val=*it;
    it++;
    while(it!=a.end())
    {
        int ant=*it;
        if(val==ant)a.erase(it);
        else
            it++;
            val=ant;
    }
    int poz=1;val=0;
    for(it=a.begin();it!=a.end();it++)
    {
        int ant=*it;
        if(it==a.begin())
        {
            for(i=1;i<=n;i++)if(ant==v[i])
            {
                val=i;
                poz=i;
                break;
            }
        }
        else
            for(i=poz;i<=n;i++)if(ant==v[i])
            {
                poz=i;
                break;
            }
    }
    printf("%d\n",poz-val+1);
    return 0;
}