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;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T>
constexpr T INF() {
  return ::std::numeric_limits<T>::max();
}
template <class T>
constexpr T HINF() {
  return INF<T>() / 2;
}
template <typename T_char>
T_char TL(T_char cX) {
  return tolower(cX);
};
template <typename T_char>
T_char TU(T_char cX) {
  return toupper(cX);
};
const int vy[] = {-1, -1, -1, 0, 1, 1, 1, 0},
          vx[] = {-1, 0, 1, 1, 1, 0, -1, -1};
const int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};
const char dir[4] = {'u', 'l', 'd', 'r'};
int popcnt(unsigned long long n) {
  int cnt = 0;
  for (int i = 0; i < 64; i++)
    if ((n >> i) & 1) cnt++;
  return cnt;
}
int d_sum(LL n) {
  int ret = 0;
  while (n > 0) {
    ret += n % 10;
    n /= 10;
  }
  return ret;
}
int d_cnt(LL n) {
  int ret = 0;
  while (n > 0) {
    ret++;
    n /= 10;
  }
  return ret;
}
LL gcd(LL a, LL b) {
  if (b == 0) return a;
  return gcd(b, a % b);
};
LL lcm(LL a, LL b) {
  LL g = gcd(a, b);
  return a / g * b;
};
#pragma warning(disable : 4996)
int n;
int w[1010];
vector<pair<int, int>> v;
vector<int> G[1010];
bool used[1010];
int main() {
  cin >> n;
  int minl = INF<int>();
  for (LL i = (0); i < (n); i++) {
    cin >> w[i];
    minl = min(minl, w[i]);
  }
  for (LL i = (0); i < (n); i++) {
    v.emplace_back(w[i], i);
  }
  sort((v).begin(), (v).end());
  for (LL i = (0); i < (n); i++) {
    G[v[i].second].emplace_back(i);
  }
  queue<int> q;
  int sum = 0;
  int cnt = 0;
  LL ans = 0;
  int minll = INF<int>();
  for (LL i = (0); i < (n); i++) {
    if (!used[i]) q.push(i);
    while (!q.empty()) {
      int cur = q.front();
      q.pop();
      used[cur] = true;
      sum += v[cur].first;
      minll = min(minll, v[cur].first);
      cnt++;
      if (!used[G[cur][0]])
        q.push(G[cur][0]);
      else {
        ans += min(sum + (cnt - 2) * minll, sum + minl * (cnt + 1));
        sum = 0;
        cnt = 0;
        minll = INF<int>();
      }
    }
  }
  cout << ans << endl;
}
