#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 10e8
#define INF 1<<30
#define MOD 1000000007
#define mod 1000000007
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp(pair<ll,ll>a,pair<ll,ll> b){
        if(a.se!=b.se)
        return a.se<b.se;
        else
        return a.fi<b.fi;
}
//----------------------------------------------------------------------
int color[1100];int ans=0;
//----------------------------------------------------------------------
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------  
    //ll begin_time=clock();
    //------------------------------
    int n;cin>>n;
    V<int>w(n);
    for(int i=0;i<n;i++)cin>>w[i];
    V<int>cm(n);
    for(int i=0;i<n;i++)cm[i]=w[i];sort(all(cm));
    //for(int i=0;i<n;i++)cout<<cm[i]<<" ";cout<<endl;
    int minel=cm[0];
    map<int,int>m,m2;
    for(int i=0;i<n;i++){m[cm[i]]=i;m2[i]=cm[i];}
    int ans=0;
    for(int i=0;i<n;i++){
        if(color[i])continue;
        if(i!=m[w[i]]){
            //cout<<w[i]<<endl;
            V<int>chikan;
            chikan.pb(w[i]);
            int start=w[i];
            int cmm = w[m[w[i]]];
            //cout<<cmm<<endl;
            chikan.pb(cmm);
            int now=m[w[i]];
            color[m[w[i]]]++;
            color[i]++;
            while(cmm!=start){
                //cout<<m[cmm]<<" "<<now<<endl;
                if(m[cmm]!=now){
                    int should = m[cmm];
                    int butis=w[should];
                    cmm=butis;
                    color[should]++;
                    if(cmm!=start)chikan.pb(cmm);
                }
            }
            sort(all(chikan));
            //for(int i=0;i<chikan.size();i++)cout<<chikan[i]<<" ";cout<<endl;
            int tmp=0;
            for(int i=0;i<chikan.size();i++){
                if(i==0)tmp+=(chikan.size()-1)*chikan[i];
                else tmp+=chikan[i];
            }
            int tmp2=0;
            for(int i=0;i<chikan.size();i++){
                tmp2+=chikan[i];
                if(i==0)tmp2+=chikan[i];
            }
            tmp2+=(chikan.size()+1)*minel;
            chmin(tmp,tmp2);
            //cout<<tmp<<endl;
            ans+=tmp;
        }
    }
    cout<<ans<<endl;
    //-------------------------------  
    //ll end_time=clock();cout<<"time="<<end_time-begin_time<<"ms"<<endl;
    //-------------------------------
    return 0;
}
//----------------------------------------------------------------------















































Measured memory_bytes: 3304