#include<bits/stdc++.h>
#define int long long
#define N 201000
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))
using namespace std;
struct node{
	int val,indx;
	node(){}
	node(int V,int I):val(V),indx(I){}
}A[N],B[N],C[N];
bool operator<(const node a,const node b){
	return a.val<b.val;
}
int sum[N];
signed main(){
	int n;
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)
		scanf("%lld%lld",&A[i].val,&B[i].val);
	int tota,totb;
	tota=totb=0;
	for(int i=1;i<=n;i++){
		C[2*i-1]=(node){A[i].val,2*i-1};
		C[2*i]=(node){B[i].val,2*i};
		tota+=A[i].val,totb+=B[i].val;
	}
	int ans=min(tota,totb);
	sort(C+1,C+2*n+1);
	for(int i=1;i<=2*n;i++){
		sum[i]=sum[i-1]+C[i].val;
		((C[i].indx%2)?A:B)[(C[i].indx+1)>>1].indx=i;
	}
	for(int i=1;i<=n;i++){
		int tmp;
		if(A[i].indx<=n&&B[i].indx<=n)
			tmp=sum[n];
		else if(A[i].indx<=n-1&&B[i].indx>n)
			tmp=sum[n-1]+C[B[i].indx].val;
		else if(A[i].indx>n&B[i].indx<=n-1)
			tmp=sum[n-1]+C[A[i].indx].val;
		else
			tmp=sum[n-2]+C[A[i].indx].val+C[B[i].indx].val;
		ans=min(ans,tmp);
	}
	printf("%lld\n",ans);
	return 0;
}