#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(void) {
    int n;
    cin >> n;

    vector<ll> a(2*n);
    vector<ll> b(2*n);
    for (int i = 0; i < 2*n; i++) cin >> a[i];
    for (int i = 0; i < 2*n; i++) cin >> b[i];

    vector<int> idx(2*n);
    for (int i = 0; i < 2*n; i++) idx[i] = i;

    sort(idx.begin(),idx.end(),[&](int i, int j)->bool{
        return a[i]+b[i] < a[j]+b[j];
    });

    ll ans = 0;
    for (int i = 0; i < 2*n; i++) {
        if (i&1) ans -= b[idx[i]];
        else ans += a[idx[i]];
    }

    cout << ans << endl;
    
    return 0;
}