//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#ifdef DEBUG
#include "./Lib/debug_VC.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

/* constant value */
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;

//=============================================================================================

auto solve(ll n, const V<PAIR>& v) {

	set<pair<PAIR, PAIR>> s;
	REP(i, n) {
		s.emplace(PAIR{v[i].first,v[i].second}, PAIR{i,1});
		s.emplace(PAIR{v[i].second,v[i].first}, PAIR{i,2});
	}

	VL state(n); ll cnt = 0;
	ll ans = 0;
	ll flg = 0;
	REPC(p, s) {
		state[p.second.first] += p.second.second;
		ans += p.first.first;
		flg |= p.second.second;
		++cnt;
		if (cnt == n) { break; }
	}
	if (flg != 3) {
		dump("all");
		return ans;
	}
	REPC(k, state)if (!(k ^ 3)) {
		dump("comp");
		return ans;
	}

	dump(ans);
	VL t_out; t_out.reserve(n);
	VL t_ok; t_ok.reserve(n);
	REP(i, n) {
		t_out.emplace_back((!(state[i] ^ 1)) ? v[i].second : v[i].first);
		t_ok.emplace_back((!(state[i] ^ 1)) ? v[i].first : v[i].second);
	}
	ll mx_i = std::max_element(ALL(t_ok)) - t_ok.begin();
	ll mn_i = std::min_element(ALL(t_out)) - t_out.begin();
	ll mx = t_ok[mx_i];
	ll mn = t_out[mn_i];
	if (mx_i != mn_i) {
		return ans - mx + mn;
	}
	ll mx2 = -1, mn2 = 1e10;
	REP(i, n) if (i != mx_i) {
		chmax(mx2, t_ok[i]);
		chmin(mn2, t_out[i]);
	}
	dump(mx, mx2, mn, mn2);
	ans = std::min(ans - mx + mn2, ans - mx2 + mn);
	return ans;
}

signed main() {
	ll n;
	cin >> n;
	V<PAIR> v;
	v.reserve(n);
	REP(_, n) {
		ll a, b;
		cin >> a >> b;
		v.emplace_back(a, b);
	}
	ll ans = solve(n, v);
	cout << ans << endl;
}

Measured memory_bytes: 19840