#include <bits/stdc++.h>
#include <chrono> 
 
using namespace std;
using namespace std::chrono; 
 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define f0r(a, b) for (long long a = 0; a < (b); ++a)
#define f1r(a, b, c) for (long long a = (b); a < (c); ++a)
#define f0rd(a, b) for (long long a = (b); a >= 0; --a)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); --a)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define mp make_pair
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < (n); ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = (lb); ele <= (rb); ele++) { if (ele > (lb)) cout << " "; cout << a[ele]; } cout << '\n';}
#define vsz(x) ((long long) x.size())
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
 
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
 
// mt19937 rng(steady_clock::now().time_since_epoch().count());
mt19937 rng(61378913);
/* usage - just do rng() */
 
void usaco(string filename) {
  // #pragma message("be careful, freopen may be wrong")
	freopen((filename + ".in").c_str(), "r", stdin);
	freopen((filename + ".out").c_str(), "w", stdout);
}
 
const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;

#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 

template <typename num_t>
using ordered_set = tree<num_t, null_type, less<num_t>, rb_tree_tag, tree_order_statistics_node_update>;

template <typename num_t>
struct ordered_multiset {
	ordered_set<pair<num_t, int> > vals;
	set<pair<int, int> > best; /* start at -1 */
	
	/* helper, find the lowest value that represents the element */
	int findbest (int val) {
		return (*best.upper_bound(make_pair(val - 1, 0))).second;
	}
	
	/* is element in set */
	bool contains(int val) {
		return vals.find(make_pair(val, -1)) != vals.end();
	}
	
	void insert(int val) {
		if (contains(val)) { /* already in, update lowest value and insert a new one */
			int loc = findbest(val);
			best.erase(make_pair(val, loc));
			best.insert(make_pair(val, loc - 1));
			vals.insert(make_pair(val, loc - 1));
		} else { /* make lowest value -1 and insert it */
			best.insert(make_pair(val, -1));
			vals.insert(make_pair(val, -1));
		}
	}
	
	void erase(int val) { /* erases one */
		if (!contains(val)) return; /* not in */
		int loc = findbest(val);
		
		/* remove the element and its best */
		best.erase(make_pair(val, loc));
		vals.erase(make_pair(val, loc));
		if (loc != -1) best.insert(make_pair(val, loc + 1)); /* more elements in set, update best */
	}
	
	/* unmodified functions */
	int find_by_order(int k) { return (*vals.find_by_order(k)).first; }
	int order_of_key(int k) { return vals.order_of_key(make_pair(k - 1, 0)); }
	pair<int, int>* begin() { return vals.begin(); }
	pair<int, int>* end() { return vals.end(); }
	pair<int, int>* rbegin() { return vals.rbegin(); }
	pair<int, int>* rend() { return vals.rend(); }
	int size() { return vals.size(); }
	void clear() { vals.clear(); best.clear(); }
	int count(int k) { return vals.order_of_key(k + 1) - vals.order_of_key(k); }
	pair<int, int>* lower_bound(int k) { return vals.lower_bound(make_pair(k - 1, 0)); }
	pair<int, int>* upper_bound(int k) { return vals.upper_bound(make_pair(k, 0)); }
};
 
ll n, m, k, q, l, r, x, y, z;
ll a[1000005];
ll b[1000005];
ll c[1000005];
string s, t;
ll ans = 0;

ordered_multiset<ll> lv, rv;

void solve(int tc) {
  cin >> n;
  ll n3 = 3 * n;
  ai(a, n3);

  f0r(i, n * 2) b[i] = a[i + n];
  sort(b, b + (2 * n));

  ll lm = 0, rm = 0;
  ll ls = 0, rs = 0;
  f1r(i, n, 2 * n) rm += b[i];
  f0r(i, n) {
    ls += a[i];
    lv.insert(a[i]);
  }
  f1r(i, n, n3) {
    rs += a[i];
    rv.insert(a[i]);
  }

  ans = (ls - lm) - (rs - rm);

  f1r(i, n, 2 * n) {
    // cout << ls << " " << lm << " " << rs << " " << rm << endl;

    ll rloc = rv.order_of_key(a[i]);
    if (rloc >= n) {
      rm -= a[i];
    } else {
      rm -= rv.find_by_order(n);
    }
    rv.erase(a[i]);
    rs -= a[i];

    ls += a[i];
    ll ov = lv.find_by_order(n - 1);
    lv.insert(a[i]);
    ll lloc = lv.order_of_key(a[i]);
    if (lloc <= i - n) {
      lm += a[i];
    } else {
      lm += lv.find_by_order(i - n);
    }

    ans = max(ans, (ls - lm) - (rs - rm));
  }

  // cout << ls << " " << lm << " " << rs << " " << rm << endl;

  cout << ans << '\n';
}
 
int main() {
  send help
 
  // usaco("cowland");

  int tc = 1;
  // cin >> tc;
  for (int t = 0; t < tc; t++) solve(t);
} 

Measured memory_bytes: 40264