// {{{ by shik
#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i = (a); i <= int(b); i++)
#define MP make_pair
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

namespace { namespace shik {

template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%" SCNd64, &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }

template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%" PRId64, x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }

#ifdef SHIK
#include "dump.hpp"
#else
#define dump(...)
#endif

template<class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) { sort(begin(v), end(v), f); v.resize(unique(begin(v), end(v)) - begin(v)); }
template<class T> inline T bit(T x, int i) { return (x >> i) & 1; }
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

// }}}

const int N=1e5+10;
int n,a[N],b[N];

void main() {
    R(n);
    REP(i,n) R(a[i],b[i]);
    LL sa=0,sb=0;
    REP(i,n) sa+=a[i];
    REP(i,n) sb+=b[i];
    LL ans=min(sa,sb);
    multiset<int> sl,sr;
    REP(i,n) {
        sl.insert(a[i]);
        sl.insert(b[i]);
    }
    while ( SZ(sl)>n ) {
        auto it=--sl.end();
        sr.insert(*it);
        sl.erase(it);
    }
    LL now=0;
    for ( int i:sl ) now+=i;
    REP(i,n) {
        for ( int j:{a[i],b[i]} ) {
            auto it=sl.find(j);
            if ( it!=sl.end() ) {
                sl.erase(it);
                now-=j;
            } else {
                it=sr.find(j);
                assert(it!=sr.end());
                sr.erase(it);
            }
        }
        while ( SZ(sl)>n-2 ) {
            auto it=--sl.end();
            now-=*it;
            sr.insert(*it);
            sl.erase(it);
        }
        now+=a[i]+b[i];
        sl.insert(a[i]);
        sl.insert(b[i]);
        chkmin(ans,now);
        REP(j,2) {
            auto it=sr.begin();
            now+=*it;
            sl.insert(*it);
            sr.erase(it);
        }
        while ( SZ(sl)>n ) {
            auto it=--sl.end();
            now-=*it;
            sr.insert(*it);
            sl.erase(it);
        }
        // dump(sl,sr);
    }
    W(ans);
}

// {{{ main
}}
int main() { shik::main(); return 0; }
// }}}


Measured memory_bytes: 10368