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>
int n, a[1000], s;
int b[1000], t[10000 + 1];
int partition(int a[], int p, int r) {
  int i, j;
  int t, x;
  x = a[r];
  i = p - 1;
  for (j = p; j < r; j++) {
    if (a[j] <= x) {
      i++;
      t = a[i];
      a[i] = a[j];
      a[j] = t;
    }
  }
  t = a[i + 1];
  a[i + 1] = a[r];
  a[r] = t;
  return i + 1;
}
void quickSort(int a[], int p, int r) {
  int q;
  if (p < r) {
    q = partition(a, p, r);
    quickSort(a, p, q - 1);
    quickSort(a, q + 1, r);
  }
}
int solve() {
  int i, ans = 0, cur, S, m, an, v;
  int V[1000];
  for (i = 0; i < n; i++) {
    b[i] = a[i];
    V[1000] = 0;
  }
  quickSort(b, 0, n - 1);
  for (i = 0; i < n; i++) t[b[i]] = i;
  for (i = 0; i < n; i++) {
    if (V[i]) continue;
    cur = i;
    S = 0;
    m = 10000;
    an = 0;
    while (1) {
      V[cur] = 1;
      an++;
      v = a[cur];
      if (v < m) m = v;
      S += v;
      cur = t[v];
      if (V[cur]) break;
    }
    if (S + (an - 2) * m < m + S + (an + 1) * s) ans += S + (an - 2) * m;
    if (S + (an - 2) * m > m + S + (an + 1) * s) ans += m + S + (an + 1) * s;
  }
  return ans;
}
int main() {
  int i;
  scanf("%d", &n);
  s = 10000;
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    if (a[i] < s) s = a[i];
  }
  int ans = solve();
  printf("%d\n", ans);
  return 0;
}
