#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
#define mp make_pair
#define pir pair<int,int>
#define fi first
#define se second
using namespace std;
void chkmin(int &a,int b){a=min(a,b);}
void chkmax(int &a,int b){a=max(a,b);}
inline int re()
{
    char c=getchar();
    int x=0,f=1;
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f;
}
const int N=2000010;
int n;
int a[N],w[N],pos[N];
int stk[N],top;
int ans;
int sufmax[N],sufcnt[N];
int tmpres[N];
signed main()
{
    freopen("sorttros.in","r",stdin);
    freopen("sorttros.out","w",stdout);
    n=re();
    for(int i=1;i<=n;i++) a[i]=re(),w[a[i]]=i;
    bool flag=0;
    int minn=n+1,semin=n+1;
    for(int i=1;i<=n;i++)
    {
        if(semin<a[i]) flag=1;
        if(minn>a[i]) semin=minn,minn=a[i];
        else if(semin>a[i]) semin=a[i];
    }
    sufmax[n+1]=0;sufcnt[n+1]=0;
    for(int i=n;i>=1;i--)
    {
        sufmax[i]=sufmax[i+1];sufcnt[i]=sufcnt[i+1];
        if(a[i]>sufmax[i+1]) sufmax[i]=a[i],sufcnt[i]++;
    }
    w[0]=n+1;
    int pos=-1;
    for(int i=n;i>=1;i--)
    {
        chkmax(pos,w[i]);
        ans+=sufcnt[pos+1];
        ans+=w[i-1]<=pos;
    }
    ans+=flag;
    printf("%lld\n",ans);
    return 0;
}