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

template<class T> istream& operator >> (istream& is, vector<T>& vec) {
    for(T& x : vec) is >> x;
    return is;
}

template<class T> ostream& operator << (ostream& os, const vector<T>& vec) {
    if(vec.empty()) return os;
    os << vec[0];
    for(auto it = vec.begin(); ++it != vec.end(); ) os << ' ' << *it;
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    n *= 2;
    vector<ll> a(n), b(n);
    vector<pair<ll,int>> c(n);
    cin >> a >> b;
    for(int i = 0; i < n; i++){
        c[i].first = a[i] + b[i];
        c[i].second = i;
    }
    sort(c.begin(), c.end());
    constexpr ll INF = 1ll << 60;
    vector dp(n + 1, vector<ll>(n + 1, -INF));
    auto rec = [&](auto rec, int l, int r) -> ll {
        if(l == r) return 0;
        if(dp[l][r] != -INF) return dp[l][r];
        if((r - l) % 2 == 0){
            dp[l][r] = min(a[c[l].second] + rec(rec, l + 1, r), a[c[r - 1].second] + rec(rec, l, r - 1));
        }else{
            dp[l][r] = max(-b[c[l].second] + rec(rec, l + 1, r), -b[c[r - 1].second] + rec(rec, l, r - 1));
        }
        return dp[l][r];
    };
    cout << rec(rec, 0, n) << '\n';
}