N = input()
soldiers = input().split(" ")
for s in range(0, len(soldiers)):
soldiers[s] = int(soldiers[s])
maxest = max(soldiers)
max_moves = soldiers.index(max(soldiers))
soldiers.remove(maxest)
soldiers.reverse()
min_moves = soldiers.index(min(soldiers))
print(max_moves + min_moves)
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
int a[n], max=0,min=101,maxpos,minpos;
for(int i=0;i<n;++i){
cin>>a[i];
if(a[i]>max){
max=a[i];
maxpos=i;
}
if(a[i]<=min){
min=a[i];
minpos=i;
}
}
if(maxpos>minpos){
minpos++;
}
cout<<maxpos+(n-1)-minpos<<endl;
return 0;
}
25B - Phone numbers | 1633C - Kill the Monster |
1611A - Make Even | 1030B - Vasya and Cornfield |
1631A - Min Max Swap | 1296B - Food Buying |
133A - HQ9+ | 1650D - Twist the Permutation |
1209A - Paint the Numbers | 1234A - Equalize Prices Again |
1613A - Long Comparison | 1624B - Make AP |
660B - Seating On Bus | 405A - Gravity Flip |
499B - Lecture | 709A - Juicer |
1358C - Celex Update | 1466B - Last minute enhancements |
450B - Jzzhu and Sequences | 1582C - Grandma Capa Knits a Scarf |
492A - Vanya and Cubes | 217A - Ice Skating |
270A - Fancy Fence | 181A - Series of Crimes |
1638A - Reverse | 1654C - Alice and the Cake |
369A - Valera and Plates | 1626A - Equidistant Letters |
977D - Divide by three multiply by two | 1654B - Prefix Removals |