#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
int a[100010],b[100010];
int tmp[200010];
long long f[200010];
int main()
{
	int n;scanf("%d",&n);
	long long ans1=0,ans2=0;
	for(int i=1;i<=n;i++)
	{
		scanf("%d %d",&a[i],&b[i]);
		tmp[i*2-1]=a[i];tmp[i*2]=b[i];
		ans1+=a[i];ans2+=b[i];
	}
	sort(tmp+1,tmp+n*2+1);
	for(int i=1;i<=n*2;i++)
		f[i]=f[i-1]+tmp[i];
	long long ans=min(ans1,ans2);
	for(int i=1;i<=n;i++)
	{
		int pos1=lower_bound(tmp+1,tmp+n*2+1,a[i])-tmp;
		int pos2=lower_bound(tmp+1,tmp+n*2+1,b[i])-tmp;
		if(pos1>pos2)swap(pos1,pos2);
		if(pos2<=n)ans=min(ans,f[n]);
		else if(pos1<n)ans=min(ans,f[n-1]+tmp[pos2]);
		else ans=min(ans,f[n-2]+tmp[pos1]+tmp[pos2]);
	}
	printf("%lld\n",ans);
	return 0;
}