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 solve(void);
void Ssort(int[], int);
int min(int, int);
int A[1000];
int B[1000];
int T[1000];
int n, s;
int kai = 0;
int main() {
  int i, j;
  scanf("%d", &n);
  s = 10000;
  ;
  for (i = 0; i < n; i++) {
    scanf("%d", &A[i]);
    s = min(s, A[i]);
  }
  printf("%d\n", solve());
  return 0;
}
int solve() {
  int kai = 0;
  int i;
  int now;
  int S, m, v;
  bool b[1000];
  for (i = 0; i < n; i++) {
    B[i] = A[i];
    b[i] = false;
  }
  Ssort(B, n);
  for (i = 0; i < n; i++) {
    T[B[i]] = i;
  }
  for (i = 0; i < n; i++) {
    if (b[i]) continue;
    now = i;
    S = 0;
    m = 10000;
    ;
    kai = 0;
    while (1) {
      b[now] = true;
      kai++;
      v = A[now];
      m = min(m, v);
      S += v;
      now = T[v];
      if (b[now]) break;
    }
    kai += min(S + (kai - 2) * m, m + S + (kai + 1) * s);
  }
  return kai;
}
void Ssort(int A[], int N) {
  int i, j;
  int tmp;
  for (i = 0; i < N - 1; i++) {
    for (j = N - 1; j > i; j--) {
      if (A[j] < A[j - 1]) {
        tmp = A[j];
        A[j] = A[j - 1];
        A[j - 1] = tmp;
      }
    }
  }
}
int min(int a, int b) {
  if (a < b)
    return a;
  else
    return b;
}
