#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
//#define ll __int128
#define int ll
//#define int ll
//#define char ll
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cerr << (#x) << " = " << (x) << endl;

#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif

const double PI = 2 * acos(0.0);
#define rand shittttty_shit
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1>
inline istream & operator >> (istream &in, pair<T0, T1> &a) {
    return in >> a.first >> a.second;
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();



signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef MAX_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(4) << fixed;
    smain();
#ifdef MAX_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
    return 0;
}

void smain() {
    int n;
    cin >> n;

    ll f = 0, s = 0;
    vi a;
    vector<pii> qrs(n);
    fori (i, n) {
        int x, y;
        cin >> x >> y;
        f += x;
        s += y;
        a.push_back(x);
        a.push_back(y);
        qrs[i] = {x, y};
    }

    sort(ALL(a));

    multiset<int> h1, h2;
    ll cur = 0;
    fori (i, n) {
        h1.insert(a[i]);
        cur += a[i];
        h2.insert(a[i + n]);
    }

    auto erase = [&] (int x) -> void {
        if (h2.count(x)) {
            h2.erase(h2.find(x));
        } else {
            assert(h1.count(x));
            cur -= x;
            h1.erase(h1.find(x));
        }
    };


    auto norm = [&] () -> void {
        while (SZ(h2) > n) {
            auto it = h2.begin();
            h1.insert(*it);
            cur += *it;
            h2.erase(it);
        }
        while (SZ(h2) < n) {
            assert(h1.size());
            auto it = prev(h1.end());
            h2.insert(*it);
            cur -= *it;
            h1.erase(it);
        }
        while (SZ(h1) && SZ(h2) && *h1.rbegin() > *h2.begin()) {
            int f = *h1.rbegin();
            int s = *h2.begin();
            h1.insert(s);
            h1.erase(h1.find(f));
            cur += s - f;
            h2.insert(f);
            h2.erase(h2.find(s));
        }
    };
    ll ans = min(f, s);

    fori (i, n) {
        int x = qrs[i].first, y = qrs[i].second;

        erase(x);
        erase(y);

        norm();
//        assert(h1.size() == n - 2);
//        assert(h2.size() == n);
//        if (SZ(h1)) {
//            assert(*h1.rbegin() <= *h2.begin());
//        }
        inmin(ans, cur + x + y);
        h2.insert(x);
        h2.insert(y);
    }

    cout << ans;
}

Measured memory_bytes: 12784