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

int n;
long long s[200010],ans,a[100010],b[100010],c[200010];
int main()
{
 scanf("%d",&n);
 long long ji1=0,ji2=0;
 for(int i=1;i<=n;++i)
 {
  scanf("%lld%lld",&a[i],&b[i]);
  c[i]=a[i];
  c[i+n]=b[i];
  ji1+=a[i];
  ji2+=b[i];
 }
 ans=min(ji1,ji2);
 sort(c+1,c+2*n+1);
 for(int i=1;i<=n;++i)
 s[i]=s[i-1]+c[i];
 for(int i=1;i<=n;++i)
 {
  long long x=a[i],y=b[i];
  if(x>y)
  swap(x,y);
  if(lower_bound(c+1,c+2*n+1,x)-c<=n-2)
  {
   if(lower_bound(c+1,c+2*n+1,y)-c<=n-1)
   ans=min(ans,s[n]);
   else
   ans=min(ans,y+s[n-1]);
  }
  else
  ans=min(ans,x+y+s[n-2]);
 }
 printf("%lld\n",ans);
 return 0;
}