#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <cstdint>
#include <cctype>
#include <numeric>
#include <bitset>
#include <functional>

using namespace std;

using ll =  long long;
using Pll = pair<ll, ll>;
using Pii = pair<int, int>;

constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr ll MOD = 1000000007;
constexpr long double EPS = 1e-10;
constexpr int dyx[4][2] = {
    { 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int n;
    cin >> n;
    vector<ll> a(2*n);
    for(int i=0;i<2*n;++i) {
        cin >> a[i];
    }

    int l = 0, r = 2*n-1;
    ll ans = 0;
    for(int i=0;i<n;++i) {
        if(a[l] - a[l+1] > a[r] - a[r-1]) {
            ans += a[l] - a[l+1];
            l += 2;
        } else {
            ans += a[r] - a[r-1];
            r -= 2;
        }
    }

    cout << ans << endl;
}