#ifdef LOCAL
    #define _GLIBCXX_DEBUG
#endif



#include <cstdio>
#include <iostream>
#include <cmath>
#include <utility>
#include <memory>
#include <memory.h>
#include <cstdlib>
#include <set>
#include <map>
#include <cassert>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <numeric>
#include <algorithm>
#include <complex>
#include <vector>
#include <random>
#include <ctime>
#include <ostream>
#include <queue>
#include <array>


using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ld = long double;
using vi = std::vector<int>;
using pii = std::pair<int, int>;
using vvi = std::vector<vi>;
using vii = std::vector<pii>;
using vll = std::vector<ll>;
using pll = std::pair<ll, ll>;

#define MAKE_FINAL_NAME_HELPER(A, B) A ## B
#define MAKE_FINAL_NAME(NAME, NUM) MAKE_FINAL_NAME_HELPER(NAME ## _, NUM)
#define ARGUMENTS_SIZE_HELPER(_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, _11, _12, _13, _14, _15, COUNT, ...) COUNT
#define ARGUMENTS_SIZE(...) ARGUMENTS_SIZE_HELPER(__VA_ARGS__, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1)
#define SELECT_MACRO(NAME, ...) MAKE_FINAL_NAME(NAME, ARGUMENTS_SIZE(__VA_ARGS__))(__VA_ARGS__)

#define pb push_back
#define sz(c) int((c).size())
#define all(c) begin(c), end(c)
#define mp(x, y) make_pair(x, y)
#define fst first
#define snd second

#define ford(...) SELECT_MACRO(ford, __VA_ARGS__)
#define ford_3(i, s, n) for (int i = int(n) - 1; i >= int(s); --i)
#define ford_2(i, n) ford_3(i, 0, n)

#define forn(...) SELECT_MACRO(forn, __VA_ARGS__)
#define forn_3(i, s, n) for (int i = int(s); i < int(n); ++i)
#define forn_2(i, n) forn_3(i, 0, n)

#define y1 y1___
#define prev prev___
#define next next___
#define hash hash___
#define left left___
#define right right___

template<typename T>
int sign(const T& t) {
    return (t > 0) - (t < 0);
}

template<typename T, typename U>
bool remax(T& a, U b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<typename T, typename U>
bool remin(T& a, U b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
T gcd(T a, T b) {
    a = std::abs(a);
    b = std::abs(b);
    while (b) {
        a %= b;
        std::swap(a, b);
    }
    return a;
}

template<typename T>
T lcm(T a, T b) {
    a = std::abs(a);
    b = std::abs(b);
    return a / gcd(a, b) * b;
}

double get_time() {
    return static_cast<double>(clock()) / CLOCKS_PER_SEC;
}

uint32_t mrand_32t() {
    static std::random_device rd;
    // TODO: seed with 19937 bits, not with 32
    static std::mt19937 rng(rd());
    return rng();
}

uint64_t mrand_64t() {
    static std::random_device rd;
    // TODO: seed with 19937 bits, not with 32
    static std::mt19937_64 rng(rd());
    return rng();
}

template<typename T>
void make_unique(std::vector<T>& v) {
    std::sort(std::begin(v), std::end(v));
    v.erase(std::unique(std::begin(v), std::end(v)), std::end(v));
}

#include <sstream>

namespace std {

template<typename A, typename B>
string to_string(const pair <A, B>& p) {
    string str;
    str += "(";
    str += to_string(p.first);
    str += ", ";
    str += to_string(p.second);
    str += ")";
    return str;
}

string to_string(bool value) {
    return value ? "true" : "false";
}

template<typename T>
string to_string(const vector <T>& vec) {
    string str = "{ ";
    bool first = true;
    for (const auto& it : vec) {
        if (!first) {
            str += ", ";
        }
        str += to_string(it);
        first = false;
    }
    str += " }";
    return str;
}

template<typename T>
string to_string(const set <T>& s) {
    string str = "{ ";
    bool first = true;
    for (const auto& it : s) {
        if (!first) {
            str += ", ";
        }
        str += to_string(it);
        first = false;
    }
    str += " }";
    return str;
}


template<typename K, typename V>
string to_string(const map <K, V>& m) {
    string str = "{ ";
    bool first = true;
    for (const auto& it : m) {
        if (!first) {
            str += ", ";
        }
        first = false;
        str += to_string(it.first);
        str += " -> ";
        str += to_string(it.second);
    }
    str += " }";
    return str;
}

string to_string(const string& s) {
    return "\"" + s + "\"";
}

string to_string(const char* s) {
    return to_string(string(s));
}

string to_string(char ch) {
    return "\'" + string(1, ch) + "\'";
}

template<size_t N>
string to_string(const bitset<N>& b) {
    string res(N, '0');
    for (size_t i = 0; i < N; ++i) {
        res[i] = '0' + b[i];
    }
    return res;
}

template <typename T>
string to_string(const T& t) {
    std::stringstream ss;
    ss << t;
    return ss.str();
}

}

void debug_out() {
    std::cerr << std::endl;
}

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    std::cerr << " " << std::to_string(H);
    debug_out(T...);
}

#ifdef LOCAL
    #define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
    #define debug(...) std::cerr << "[" << #__VA_ARGS__ <<  "]:", debug_out(__VA_ARGS__);
#else
    #define eprintf(...)
    #define cerr if (false) cerr
    #define debug(...)
#endif

using namespace std;

/* *************************** TEMPLATE CODE ENDS HERE ******************************** */

#define TEST 0

int n;
vi a;
vi b;

bool read() {
#if !TEST
    if (!(cin >> n)) {
        return 0;
    }
    a.resize(n);
    b.resize(n);
    forn(i, n) {
        cin >> a[i] >> b[i];
    }
#else
    n = 1 + mrand_32t() % 10;
    a.resize(n);
    b.resize(n);
    forn(i, n) {
        a[i] = mrand_32t() % 10;
        b[i] = mrand_32t() % 10;
    }
#endif
    return 1;
}

const ll INF = 1e18;

ll brut() {
    ll ans = INF;
    vi p(n);
    iota(all(p), 0);
    do {
        ll cur = 0;
        forn(it, n) {
            int i = p[it];
            int j = p[(it + 1) % n];
            cur += min(a[i], b[j]);
        }
        remin(ans, cur);
    } while (next_permutation(all(p)));
    return ans;
}

ll solve() {
    vii vals;
    forn(i, n) {
        vals.pb(mp(a[i], 2 * i));
        vals.pb(mp(b[i], 2 * i + 1));
    }
    sort(all(vals));

    vvi type(n, vi(2, -1));
    const auto get_type = [&](int i, int name) -> int {
        int& t = type.at(i).at(name);
        if (t != -1) {
            return t;
        }
        if (name == 0) {
            int A = lower_bound(all(vals), mp(a[i], 2 * i)) - vals.begin();
            return (t = A >= n);
        } else if (name == 1) {
            int B = lower_bound(all(vals), mp(b[i], 2 * i + 1)) - vals.begin();
            return (t = B >= n);
        } else {
            assert(0);
        }
    };

    vector<vvi> who(2, vvi(2));
    forn(i, n) {
        int A = get_type(i, 0);
        int B = get_type(i, 1);
        who[A][B].pb(i);
    }

    ll pref = 0;
    forn(A, 2) forn(B, 2) {
        for (int i : who[A][B]) {
//            debug(A, B, i);
            if (A == 0) {
                pref += a[i];
            }
            if (B == 0) {
                pref += b[i];
            }
        }
    }

    vi is;
    forn(A, 2) forn(B, 2) {
        auto w = who[A][B];

        if (A == 0 && B == 0) {
            sort(all(w), [&](int i, int j) { return b[i] < b[j]; });
            if (!w.empty()) {
                is.pb(w.at(0));
            }
        } else if (A + B == 1) {
            sort(all(w), [&](int i, int j) { return a[i] < a[j]; });
            if (!w.empty()) {
                is.pb(w.at(0));
                is.pb(w.back());
                w.pop_back();
                reverse(all(w));
                if (!w.empty())
                w.pop_back();
            }

            sort(all(w), [&](int i, int j) { return b[i] < b[j]; });
            if (!w.empty()) {
                is.pb(w.at(0));
                is.pb(w.back());
            }
        } else {
            sort(all(w), [&](int i, int j) { return a[i] < a[j]; });
            if (!w.empty()) {
                is.pb(w.at(0));
            }
        }
    }

    sort(all(is));
    is.resize(unique(all(is)) - is.begin());

    ll ans = INF;
    do {
        ll cur = 0;
        forn(it, sz(is)) {
            int i = is[it];
            int j = is[(it + 1) % sz(is)];

            int A = get_type(i, 0);
            int B = get_type(j, 1);

            if (A + B == 1) {
                continue;
            }

            if (A == 0 && B == 0) {
                cur -= a[i];
                cur -= b[j];
            }
            cur += min(a[i], b[j]);
        }
        remin(ans, cur);
    } while (next_permutation(all(is)));

//    debug(is);
//    debug(pref, ans);

    return pref + ans;
}

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout.tie(nullptr);
    cout.precision(12);
    cout << fixed;

#ifdef LOCAL
    #define FILE_NAME "a"
    assert(freopen(FILE_NAME ".in", "r", stdin));
//    freopen(FILE_NAME ".out", "w", stdout);
#endif

    while (read()) {
        ll ans = solve();
        cout << ans << endl;

//        ll br = brut();
//        debug(br);
//
//        debug(n);
//        forn(i, n) {
//            cerr << a[i] << " " << b[i] << endl;
//        }
//        assert(br == ans);
    }

    return 0;
}


Measured memory_bytes: 8944