#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;

const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll LLINF = (ll)1e18;
const ll INTINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;

template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}

int main() {
	int N; cin >> N;
	V<V<ll>> AB(N,V<ll>(2));
	for(int i = 0; i < N; ++i) for(int j = 0 ; j < 2; ++j) cin >> AB[i][j];
	priority_queue<P<ll,P<int,int>>> pq;
	for(int i = 0; i < N; ++i) for(int j = 0 ; j < 2; ++j) pq.push({-AB[i][j],{i,j}});
	V<V<int>> flg(N,V<int>(2,0));
	for(int n = 0; n < N; ++n){
		auto tmp = pq.top(); pq.pop();
		int i = tmp.second.first;
		int j = tmp.second.second;
		flg[i][j] = 1;
	}
	int L = 0,R = 0;
	for(int i = 0; i < N; ++i) if(flg[i][0] && !flg[i][1]) L++;
	for(int i = 0; i < N; ++i) if(!flg[i][0] && flg[i][1]) R++;
	ll ans = LLINF;
	if (L+R != N || L == N || R == N){
		ans = 0;
		for(int i = 0; i < N; ++i) for(int j = 0; j < 2; ++j) if(flg[i][j]) ans += AB[i][j]; 
	}
	else{
		V<P<ll,int>> ord(2*N);
		for(int i = 0; i < N; ++i) for(int j = 0 ; j < 2; ++j) ord[i*2+j] = {AB[i][j],i};
		sort(ALL(ord));
		ll sum = 0;
		for(int i = 0; i < N; ++i) sum += ord[i].first;
		for(int i = 0; i < N; ++i) {
			ll cnt = sum;
			cnt -= ord[i].first;
			if(ord[N].second != ord[i].second) cnt += ord[N].first;
			else cnt += ord[N+1].first;
			chmin(ans,cnt);
		}
	}
	cout << ans << endl;
	
	return 0;
}


Measured memory_bytes: 18156