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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {

	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub

		BufferedReader br=new BufferedReader(new  InputStreamReader(System.in));
		int n=Integer.parseInt(br.readLine());
		int[] W=new int[n];
		String[] in=br.readLine().split("\\s+");
		
		for(int i=0;i<n;i++){
			W[i]=Integer.parseInt(in[i]);
		}
		System.out.println(minCost(W));
	}

	public  static int minCost(int[] W){
		int[] sort=W.clone();
		Arrays.sort(sort);
		int cost=0;
		for(int i=0;i<W.length;i++){
			int a=indexOf(W,sort[i]);
			int j=0;
			while(a>i){
				j++;
				int b=indexOf(W, sort[a]);
				cost+=W[b];
				
				int work=W[a];
				W[a]=W[b];
				W[b]=work;
				
				a=b;
			}
			cost+=Math.min(sort[i]*j, sort[i]*2+sort[0]*(j+2));
		}
		return cost;
	}

	private static int indexOf(int[] A, int x) {
		// TODO Auto-generated method stub
		for(int i=0;i<A.length;i++){
			if(A[i]==x)
				return i;
		}
		
		return -1;
	}
}

