#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

#define maxn 100005

#define INF 0x3f3f3f3f

#define maxtree maxn<<2

int n,ai[maxn],val[maxtree],L[maxtree],R[maxtree],Min[maxtree];

int P[maxtree],mid[maxtree];

inline void in(int &now)

{

    char Cget=getchar();now=;

    while(Cget>''||Cget<'') Cget=getchar();

    while(Cget>=''&&Cget<='')

    {

        now=now*+Cget-'';

        Cget=getchar();

    }

}

void updata(int now)

{

    val[now]=val[now<<]+val[now<<|];

    Min[now]=min(Min[now<<],Min[now<<|]);

    if(Min[now]==Min[now<<|]) P[now]=P[now<<|];

    else P[now]=P[now<<];

}

void build(int now,int l,int r)

{

    L[now]=l,R[now]=r;

    if(l==r)

    {

        Min[now]=ai[l],P[now]=l,val[now]=;

        return;

    }

    mid[now]=l+r>>;

    build(now<<,l,mid[now]);

    build(now<<|,mid[now]+,r);

    updata(now);

}

void change(int now,int to)

{

    if(L[now]==R[now])

    {

        val[now]=,Min[now]=INF,P[now]=;

        return;

    }

    if(to<=mid[now]) change(now<<,to);

    else change(now<<|,to);

    updata(now);

}

int query(int now,int l,int r)

{

    if(L[now]>=l&&R[now]<=r) return val[now];

    int res=;

    if(l<=mid[now]) res+=query(now<<,l,r);

    if(r>mid[now]) res+=query(now<<|,l,r);

    return res;

}

int get(int now,int l,int r)

{

    if(L[now]>=l&&R[now]<=r) return P[now];

    int tmp1=,tmp2=;

    if(l<=mid[now]) tmp1=get(now<<,l,r);

    if(r>mid[now]) tmp2=get(now<<|,l,r);

    if(tmp2&&tmp1)

    {

        if(ai[tmp1]<ai[tmp2]) return tmp1;

        else return tmp2;

    }

    if(tmp2) return tmp2;

    if(tmp1) return tmp1;

    return ;

}

int main()

{

    in(n);

    for(int i=;i<=n;i++) in(ai[i]);

    int l=,r=n;while(l<r) swap(ai[l],ai[r]),l++,r--;

    build(,,n);

    int now=n,tmp1,tmp2,tmp;

    long long ans=;

    for(int i=;i<=n;i++)

    {

        tmp1=,tmp2=,tmp1=get(,,now);

        if(now<n) tmp2=get(,now+,n);

        if(tmp1&&tmp2)

        {

            if(ai[tmp2]<ai[tmp1]) tmp=tmp2;

            else tmp=tmp1;

        }

        else if(tmp1) tmp=tmp1;

        else tmp=tmp2;

        if(tmp<=now) ans+=query(,tmp,now);

        else ans+=query(,,now)+query(,tmp,n);

        change(,tmp),now=tmp;

    }

    cout<<ans;

    return ;

}