#include<bits/stdc++.h>
   
using namespace std;
  
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define all(x) (x).begin(),(x).end()
#define Fixed fixed << setprecision(14)
#define int int64_t
using pii = pair<int,int>;
constexpr int INF  = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod1 = 1e9+7; 
constexpr int mod2 = 998244353;
 
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
 
template <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;
template <class T> using max_heap = priority_queue<T>;
template <class A,class B> using umap = unordered_map<A,B>;
   
int gcd(int a,int b){ return b ? gcd(b,a % b) : a;}
int lcm(int a,int b){ return a / gcd(a,b) * b;}
inline int updiv(int a,int b){ return (a + b - 1) / b; }

signed main(void){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);

  int n;
  cin >> n;
  int sum1 = 0, sum2 = 0;
  vector<int> a(n*2);

  for(int i = 0; i < n*2; ++i){
    cin >> a[i];
  }

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

  cout << sum1 - sum2 << '\n';

  return 0;
}