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;
int n;
int A[(1010)];
int g_min = (10010);
int B[(1010)];
int T[(10010)];
bool V[(1010)];
int solve() {
  for (int i = 0; i < n; i++) {
    V[i] = false;
    B[i] = A[i];
  }
  sort(B, B + n);
  for (int i = 0; i < n; i++) {
    T[B[i]] = i;
  }
  int ret = 0;
  for (int i = 0; i < n; i++) {
    if (V[i]) continue;
    int cur = i;
    int num = 0;
    int l_min = (10010);
    int sum_l = 0;
    while (1) {
      V[cur] = true;
      num++;
      l_min = min(l_min, A[cur]);
      sum_l += A[cur];
      cur = T[A[i]];
      if (V[cur]) break;
    }
    int c0 = sum_l + (num - 2) * l_min;
    int c1 = sum_l + l_min + (num + 1) * g_min;
    ret += min(c0, c1);
  }
  return ret;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &A[i]);
    g_min = min(g_min, A[i]);
  }
  int ans = solve();
  printf("%d\n", ans);
  return 0;
}
