You are given $n$ integers $w_i (i = 0, 1, ..., n-1)$ to be sorted in ascending order. You can swap two integers $w_i$ and $w_j$. Each swap operation has a cost, which is the sum of the two integers $w_i + w_j$. You can perform the operations any number of times.

Write a program which reports the minimal total cost to sort the given integers.

Constraints

* $1 \leq n \leq 1,000$
* $0 \leq w_i\leq 10^4$
* $w_i$ are all different

Input

In the first line, an integer $n$ is given. In the second line, $n$ integers $w_i (i = 0, 1, 2, ... n-1)$ separated by space characters are given.

Output

Print the minimal cost in a line.

Examples

Input

5
1 5 3 4 2


Output

7


Input

4
4 3 2 1


Output

10
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   for(int i=0;i<(n);++i)
#define SORT(c)    sort((c).begin(),(c).end())
#define EPS 1e-10;//sample:if((double)>=(double)+EPS)
#define CLR(a) memset((&a), 0 ,sizeof(a))//clear memory
#define dump(x)  cerr << #x << " = " << (x) << endl;//debug
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
//cin,cout release
//std::cin.tie(0);
//ios::sync_with_stdio(false);

using namespace std;

#define MAX 1000
#define VMAX 10000

int main(){
  int n,w[1000],ans=0,s=INT_MAX;
  cin>>n;
  rep(i,n){
    scanf("%d",&w[i]);
    s=min(s,w[i]);
  }
  bool V[VMAX]={};
  int B[MAX]={},T[VMAX]={};
  rep(i,n)B[i] = w[i];
  sort(B,B+n);
  rep(i,n)T[B[i]]=i;
  rep(i,n){
    if(V[i]) continue;
    int cur=i,S=0,m=VMAX,an=0;
    do{
      V[cur]=true;
      an++;
      int v=w[cur];
      m=min(m,v);
      S+=v;
      cur = T[v];
    }while(!V[cur]);
    ans+=min(S+(an-2)*m,m+S+(an+1)*s);
  }
  cout<<ans<<endl;
  return 0;
}

