#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5;
int n,cnt[maxn];
long long ans=1e15,Ans,tot[2];
bool flag=false;
struct point{
	long long bel,val;
}p[2*maxn];
inline long long read(){
	long long x=0,f=1;
	char c;
	do{c=getchar();if(c=='-') f*=-1;}while(!isdigit(c));
	while(isdigit(c)){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
	return x*f;
}
bool cmp(const point a,const point b){return a.val<b.val;}

int main(){
	n=read();
	for(int i=1;i<=n;i++){
		p[2*i].val=read();p[2*i-1].bel=i;
		p[2*i-1].val=read();p[2*i].bel=i;
		tot[0]+=p[2*i].val;tot[1]+=p[2*i-1].val;
	}
	ans=min(tot[0],tot[1]);
	sort(p+1,p+2*n+1,cmp);
	for(int i=1;i<=n;i++){
		cnt[p[i].bel]++;Ans+=p[i].val;
		if(cnt[p[i].bel]==2) flag=true;
	}
	if(flag){ans=min(ans,Ans);}
	else{
		ans=min(ans,(p[n].bel==p[n+1].bel)?min(Ans-p[n].val+p[n+2].val,Ans-p[n-1].val+p[n+1].val):Ans-p[n].val+p[n+1].val);
	}
	printf("%lld\n",ans);
	return 0;
}