#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main() {
  int N;
  cin >> N;
  const int K = 2 * N;
  vector<ll> A(K), B(K);
  for(int i = 0; i < K; i++) cin >> A[i];
  for(int i = 0; i < K; i++) cin >> B[i];
  vector<ll> C(K);
  for(int i = 0; i < K; i++) C[i] = - A[i] - B[i];
  sort(C.rbegin(), C.rend());
  ll ans = accumulate(A.begin(), A.end(), 0LL);
  const ll INF = 1LL << 50;
  vector dp(K + 1, vector<ll>(N + 1, INF));
  dp[0][0] = 0;
  for(int i = 0; i < K; i++) {
    for(int j = 0; j <= (i + 2) / 2; j++) {
      dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + C[i]);
    }
    for(int j = 0; j < (i + 2) / 2; j++) {
      dp[i + 1][j + 1] = min(dp[i + 1][j + 1], dp[i][j]);
    }
  }
  // cout << ans << endl;
  // for(int i = 0; i < K; i++) cout << C[i] << " ";
  // cout << endl;
  // for(int i = 0; i <= K; i++) {
  //   for(int j = 0; j <= N; j++) {
  //     cout << dp[i][j] << " ";
  //   }
  //   cout << endl;
  // }
  cout << ans + dp[K][N] << endl;
}