#include<bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mp make_pair
#define pb push_back
#define fst first
#define snd second
typedef long long ll;
typedef pair<int,int> pii;

const int maxn=100005;
int n;
int a[maxn],b[maxn];
pii val[maxn*2];
bool occ[maxn];

int main(){
	scanf("%d",&n);
	ll suma=0,sumb=0;
	REP(i,n){
		scanf("%d%d",&a[i],&b[i]);
		val[i]=mp(a[i],i);
		val[i+n]=mp(b[i],i);
		suma+=a[i];
		sumb+=b[i];
	}
	sort(val+1,val+1+2*n);
	ll ans=0;
	int tot=0,cnt=0,spe=0;
	REP(i,2*n){
		int id=val[i].snd;
		if(tot==n-1&&cnt==n-1&&!occ[id]){
			spe=id;
			continue;
		}
		if(!occ[id]){
			cnt++;
			occ[id]=true;
		}
		ans+=val[i].fst;
		tot++;
		if(tot==n)break;
	}
	if(spe){
		ll ans2=a[spe]+b[spe];
		REP(i,n-2)ans2+=val[i].fst;
		ans=min(ans,ans2);
	}
	printf("%lld\n",min(ans,min(suma,sumb)));
	return 0;
}