C - Arrival of the General

Problem description

A Ministry for Defense sent a general to inspect the Super Secret Military Squad under the command of the Colonel SuperDuper. Having learned the news, the colonel ordered to all n squad soldiers to line up on the parade ground.

By the military charter the soldiers should stand in the order of non-increasing of their height. But as there's virtually no time to do that, the soldiers lined up in the arbitrary order. However, the general is rather short-sighted and he thinks that the soldiers lined up correctly if the first soldier in the line has the maximum height and the last soldier has the minimum height. Please note that the way other solders are positioned does not matter, including the case when there are several soldiers whose height is maximum or minimum. Only the heights of the first and the last soldier are important.

For example, the general considers the sequence of heights (4, 3, 4, 2, 1, 1)correct and the sequence (4, 3, 1, 2, 2) wrong.

Within one second the colonel can swap any two neighboring soldiers. Help him count the minimum time needed to form a line-up which the general will consider correct.

Input

The first input line contains the only integer n (2 ≤ n ≤ 100) which represents the number of soldiers in the line. The second line contains integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 100) the values of the soldiers' heights in the order of soldiers' heights' increasing in the order from the beginning of the line to its end. The numbers are space-separated. Numbers a₁, a₂, ..., a_n are not necessarily different.

Output

Print the only integer — the minimum number of seconds the colonel will need to form a line-up the general will like.

Examples

Input

4
33 44 11 22

Output

Input

7
10 10 58 31 63 40 76

Output

Note

In the first sample the colonel will need to swap the first and second soldier and then the third and fourth soldier. That will take 2 seconds. The resulting position of the soldiers is (44, 33, 22, 11).

In the second sample the colonel may swap the soldiers in the following sequence:

(10, 10, 58, 31, 63, 40, 76)
(10, 58, 10, 31, 63, 40, 76)
(10, 58, 10, 31, 63, 76, 40)
(10, 58, 10, 31, 76, 63, 40)
(10, 58, 31, 10, 76, 63, 40)
(10, 58, 31, 76, 10, 63, 40)
(10, 58, 31, 76, 63, 10, 40)
(10, 58, 76, 31, 63, 10, 40)
(10, 76, 58, 31, 63, 10, 40)
(76, 10, 58, 31, 63, 10, 40)
(76, 10, 58, 31, 63, 40, 10)

解题思路：题目的意思就是规定正确的序列中最大值在第一个位置，最小值在最后一个位置。要求将不满足序列中的元素采用最小交换次数将其变成正确的序列。做法：先找出最小值的下标k,注意a[k]>=a[i]（等号要加上），再将k后面的元素往前移一位，再去找最大值的下标即可，水过！

AC代码：

 #include<bits/stdc++.h>

 using namespace std;

 int main(){

     int n,m=,k=,a[];

     cin>>n;

     for(int i=;i<n;++i)cin>>a[i];

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

         if(a[k]>=a[i])k=i;//先找出最小值的下标

     m+=n-k-;

     for(int i=k;i<n-;++i)a[i]=a[i+];

     k=;

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

         if(a[k]<a[i])k=i;//找最大值的下标

     m+=k;

     cout<<m<<endl;

     return ;

 }