#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

void solve() {
  int n; cin >> n;
  pqasc<tuple<int, int, int>> q;
  vector<pair<int, int>> as;
  vector<pair<int, int>> ve;
  vector<long long> su(n * 2 + 1);
  rep(i, n) {
    int a, b; cin >> a >> b;
    q.emplace(a, i, 0);
    q.emplace(b, i, 1);
    ve.emplace_back(a, i);
    ve.emplace_back(b, i);
    as.emplace_back(a, b);
  }
  sort(all(ve));
  rep(i, 2 * n) su[i + 1] += su[i] + ve[i].first;

  long long ans = 0;
  set<int> in;
  vector<int> co(2);
  rep(i, n) {
    int x, y, z;
    tie(x, y, z) = q.top(), q.pop();
    ans += x;
    in.insert(y);
    co[z]++;
  }
  if (in.size() == n && (co[0] == 0 || co[1] == 0)) {
    cout << ans << '\n';
    return;
  }
  ans = 1e18;
  rep(i, n) {
    long long sum = su[n];
    int a, b;
    tie(a, b) = as[i];
    int x = lower_bound(all(ve), make_pair(a, i)) - ve.begin();
    int y = lower_bound(all(ve), make_pair(b, i)) - ve.begin();
    if (x < n && y < n) {
      sum -= a + b, sum += ve[n].first + ve[n + 1].first;
    } else if (x < n && y == n) {
      sum -= a, sum += ve[n + 1].first;
    } else if (x == n && y < n) {
      sum -= b, sum += ve[n + 1].first;
    } else if (x < n) {
      sum -= a, sum += ve[n].first;
    } else if (y < n) {
      sum -= b, sum += ve[n].first;
    }
    amin(ans, sum);
  }
  cout << ans << '\n';
}


Measured memory_bytes: 11812