#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 1e6+5;

int a[maxn], b[maxn];
int dp[maxn][2];
int X[2][2];

signed main(){
    IOS();

    int n; cin>>n;
    ll re = 0;
    for (int i =0 ; i<n; ++i) {
        cin>>a[i];
    }vector<int> v;
    for (int i = 0; i<n; ++i) {
        cin>>b[i];
        if ( i & 1) swap(a[i], b[i]);
        re += a[i];
        v.pb({b[i] - a[i]});
    }
    sort(ALL(v));
    for (int i = 0; i<n/2; ++i) {
        re += v[SZ(v) - i - 1];
    }
    cout<<re<<endl;


}

#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define sz(a) ((int) a.size())
#define vi vector<int>
using namespace std;
const int N = 2e5 + 7;
int n, a[N], b[N], r1[N], r2[N];
ll sum;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n;
	L(i, 1, n) cin >> a[i];
	L(i, 1, n) cin >> b[i], a[i] -= b[i], sum += b[i];
	n >>= 1; 
	L(i, 1, n) r1[i] = a[i * 2 - 1];
	L(i, 1, n) r2[i] = a[i * 2];
	sort(r1 + 1, r1 + n + 1);
	sort(r2 + 1, r2 + n + 1);
	L(i, 1, n) if(r1[i] + r2[i] > 0) sum += r1[i] + r2[i];
	cout << sum << '\n';
	return 0;
}