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
import java.util.*;
public class Main {
	Scanner sc = new Scanner(System.in);
	final static int vmax = 10000;
	final static int max = 1000;
	
	int n, s;
	int[] w;
	
	int[] B = new int[max];
	int[] T = new int[vmax+1];
	
	//入力
	public void input() {
		n = sc.nextInt();
		w = new int[n];
		s = vmax;
		for(int i=0; i<n; i++) {
			w[i] = sc.nextInt();
			s = Math.min(s, w[i]);
		}
	}
	
	//出力
	public void conan() {
		int ans = solve();
		System.out.println( ans );
	}
	
	//解を求める
	public int solve() {
		int ans = 0;
		boolean[] V = new boolean[n];
		for(int i=0; i<n; i++) {
			B[i] = w[i];
			V[i] = false;
		}
		//配列Bをソートする
		//開始と終了のインデックスを指定する
		Arrays.sort(B,0,n);
		
		for(int i=0; i<n; i++) { T[ B[i] ] = i; }
		
		for(int i=0; i<n; i++) {
			if( V[i] ) continue;
			int cur = i;
			int S = 0;
			int m = vmax;
			int an = 0;
			while( true ) {
				V[cur] = true;
				an++;
				int v = w[cur];
				m = Math.min(m, v);
				S += v;
				cur = T[v];
				if( V[cur] ) break;
			}
			ans += Math.min( S+(an-2)*m, m+S+(an+1)*s );
		}
		return ans;
	}
	
	public static void main(String[] args) {
	    Main obj = new Main();
		obj.input();
		obj.conan();
	}
}

