#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000000

int main(){
	
	int N;
	cin>>N;
	
	vector<int> A(N);
	rep(i,N){
		scanf("%d",&A[i]);
	}
	
	{
		auto B = A;
		sort(B.begin(),B.end());
		B.erase(unique(B.begin(),B.end()),B.end());
		
		rep(i,N){
			A[i] = distance(B.begin(),lower_bound(B.begin(),B.end(),A[i]));
		}
	}
	
	vector<vector<int>> inds(N+5);
	rep(i,N){
		inds[A[i]].push_back(i);
	}
	
	fenwick_tree<int> F(N);
	rep(i,N)F.add(i,1);
	
	
	int ans = 0;
	int pos = N;
	
	for(int i=N;i>=0;i--){
		if(inds[i].size()==0)continue;
		int d = distance(inds[i].begin(),upper_bound(inds[i].begin(),inds[i].end(),pos));
		d--;
		if(d<0)d += inds[i].size();
		
		rep(j,inds[i].size()){
			
			int cur = inds[i][d];
			F.add(cur,-1);
			if(cur<=pos){
				if(F.sum(cur,pos)>0)ans++;
			}
			else{
				if(F.sum(cur,N)+F.sum(0,pos)>0)ans++;
			}
			
			pos = cur;
			d--;
			if(d<0)d += inds[i].size();
			
		}
		
		
	}
	
	cout<<ans<<endl;
	
    return 0;
}