#include <iostream>
#include <algorithm>
using namespace std;
int a[1000006], b[1000006], c[1000006];
long long s[1000006];
int main(){
	int n;
	cin >> n;
	long long s1 = 0, s2 = 0;
	for (int i = 1; i <= n; ++ i){
		cin >> a[i] >> b[i];
		s1 += a[i];
		s2 += b[i];
		c[i] = a[i];
		c[i + n] = b[i];
	}
	long long ans = min(s1, s2);
	sort(c + 1, c + 1 + 2 * n);
	for (int i = 1; i <= n; ++ i)
		s[i] = s[i - 1] + c[i];
	for (int i = 1; i <= n; ++ i){
		int x = a[i], y = b[i];
		if (x > y)
			swap(x, y);
		int px = lower_bound(c + 1, c + 1 + 2 * n, x) - c;
		int py = lower_bound(c + 1, c + 1 + 2 * n, y) - c;
		if (px <= n - 2){
			if (py <= n - 1)
				ans = min(ans, s[n]);
			else
				ans = min(ans, y + s[n - 1]);
		}
		else
			ans = min(ans, x + y + s[n - 2]);
	}
	cout << ans << endl;
}
