#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#include<map>

using namespace std;

#define rep(i,s,t) for(int i=s;i<=t;i++)

#define dwn(i,s,t) for(int i=s;i>=t;i--)

#define clr(x,c) memset(x,c,sizeof(x))

#define ll long long

int read(){

    int x=0,f=1;char c=getchar();

    while(!isdigit(c)) {

        if(c=='-') f=-1;c=getchar();

    }

    while(isdigit(c)) x=x*10+c-'0',c=getchar();

    return x*f;

}

const int nmax=1e5+5;

const int maxn=1e5+5;

const int inf=0x7f7f7f7f;

map<int,int>m;

int a[nmax],to[maxn],b[nmax],mn,n;

bool vis[nmax];

void mins(ll &a,ll b){

    if(a>b) a=b;

}

ll solve(int x){

    ll tmn=a[x],cnt=1,sum=a[x];vis[x]=1;

    for(ll tmp=m[b[x]];tmp!=x;tmp=m[b[tmp]])

      cnt++,mins(tmn,a[tmp]),sum+=a[tmp],vis[tmp]=1;

    return min(sum+(cnt-2)*tmn,sum+tmn+(cnt+1)*mn);

}

int main(){

	n=read(),mn=inf;

	rep(i,1,n) a[i]=b[i]=read(),mn=min(mn,a[i]),m[a[i]]=i;

	sort(b+1,b+n+1);

	ll ans=0;

	rep(i,1,n) if(!vis[i]) ans+=solve(i);

	printf("%lld\n",ans);

	return 0;

}