#include<cstdio>
#include<algorithm>
#include<iostream>
#define RI register int
#define CI const int&
using namespace std;
const int N=100005;
struct element
{
	int v,p;
	friend inline bool operator < (const element& A,const element& B)
	{
		return A.v<B.v;
	}
}d[N<<1]; int n,a[N],b[N],p[N],q[N]; long long ans,sa,sb,ret;
int main()
{
	RI i; for (scanf("%d",&n),i=1;i<=n;++i)
	scanf("%d%d",&a[i],&b[i]),d[i].v=a[i],d[i].p=i,
	d[n+i].v=b[i],d[n+i].p=n+i,sa+=a[i],sb+=b[i];
	for (sort(d+1,d+(n<<1)+1),i=1;i<=(n<<1);++i)
	if (d[i].p<=n) p[d[i].p]=i; else q[d[i].p-n]=i;
	for (i=1;i<=n;++i) ret+=d[i].v;
	for (ans=min(sa,sb),i=1;i<=n;++i)
	if (p[i]<=n&&q[i]<=n) ans=min(ans,ret); else
	if (p[i]<=n&&q[i]>n) ans=min(ans,ret+d[q[i]].v-(p[i]!=n?d[n].v:d[n-1].v)); else
	if (p[i]>n&&q[i]<=n) ans=min(ans,ret+d[p[i]].v-(q[i]!=n?d[n].v:d[n-1].v)); else
	ans=min(ans,ret+d[p[i]].v+d[q[i]].v-d[n].v-d[n-1].v);
	return printf("%lld",ans),0;
}