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

const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define ALL(v) (v.begin(),v.end())
#define COUT(x) cout<<(x)<<"\n"

int main(){
    deque<int> dec;//右から取っていく
    ll ans = 0;
    int n;
    cin >> n;
    int t;
    REP(i,2*n){
        cin >> t;
        dec.push_front(t);
    }
    REP(i,n){
        if(dec[0]-dec[1]>=dec[dec.size()-1]-dec[dec.size()-2]){
            ans += dec[0]-dec[1];
            dec.pop_front();
            dec.pop_front();
        }
        else{
            ans += dec[dec.size()-1]-dec[dec.size()-2];
            dec.pop_back();
            dec.pop_back();
        }
    }
    COUT(ans);
    return 0;
}