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

#ifdef SG
	#include <debug.h>
#else
	template<typename T> struct outputer;
	struct outputable {};
	#define PRINT(...)
	#define OUTPUT(...)
	#define show(...)
	#define debug(...)
	#define deepen(...)
	#define timer(...)
	#define fbegin(...)
	#define fend
	#define pbegin(...)
	#define pend
#endif

#define ARG4(_1,_2,_3,_4,...) _4

#define forn3(i,l,r) for (int i = int(l); i < int(r); ++i)
#define forn2(i,n) forn3 (i, 0, n)
#define forn(...) ARG4(__VA_ARGS__, forn3, forn2) (__VA_ARGS__)

#define ford3(i,l,r) for (int i = int(r) - 1; i >= int(l); --i)
#define ford2(i,n) ford3 (i, 0, n)
#define ford(...) ARG4(__VA_ARGS__, ford3, ford2) (__VA_ARGS__)

#define ve vector
#define pa pair
#define tu tuple
#define mp make_pair
#define mt make_tuple
#define pb emplace_back
#define fs first
#define sc second
#define all(a) (a).begin(), (a).end()
#define sz(a) ((int)(a).size())

typedef long double ld;
typedef int64_t ll;
typedef uint64_t ull;
typedef uint32_t ui;
typedef uint16_t us;
typedef uint8_t uc;
typedef pa<int, int> pii;
typedef pa<int, ll> pil;
typedef pa<ll, int> pli;
typedef pa<ll, ll> pll;
typedef ve<int> vi;

template<typename T> inline auto sqr (T x) -> decltype(x * x) {return x * x;}
template<typename T1, typename T2> inline bool umx (T1& a, T2 b) {if (a < b) {a = b; return 1;} return 0;}
template<typename T1, typename T2> inline bool umn (T1& a, T2 b) {if (b < a) {a = b; return 1;} return 0;}

const int N = 100000;

struct Input {
	int n;
	int a[3 * N];
	
	bool read () {
		if (!(cin >> n)) {
			return 0;
		}
		forn (i, 3 * n) {
			scanf("%d", &a[i]);
		}
		return 1;
	}

	void init (const Input &input) {
		*this = input;
	}
};

struct Data: Input {
	ll ans;
	
	void write () {
		cout << ans << endl;
	}
};


namespace Main {
	
	struct Solution: Data {
		ll mx[3 * N + 1];
		ll mn[3 * N + 1];
		
		void solve () {
			{
				set<pii> s;
				set<int> cur;
				forn (i, 3 * n) {
					s.insert(mp(a[i], i));
				}
				ll sum = 0;
				forn (i, 2 * n + 1) {
					while (sz(cur) < n) {
						cur.insert(s.begin()->sc);
						sum += s.begin()->fs;
						s.erase(s.begin());
					}
					mn[i] = sum;
					if (*cur.begin() == i) {
						cur.erase(i);
						sum -= a[i];
					}
					s.erase(mp(a[i], i));
				}
			}
			{
				set<pii, greater<pii>> s;
				set<int, greater<int>> cur;
				forn (i, 3 * n) {
					s.insert(mp(a[i], i));
				}
				ll sum = 0;
				ford (i, n, 3 * n + 1) {
					while (sz(cur) < n) {
						cur.insert(s.begin()->sc);
						sum += s.begin()->fs;
						s.erase(s.begin());
					}
					mx[i] = sum;
					if (*cur.begin() == i - 1) {
						cur.erase(i - 1);
						sum -= a[i - 1];
					}
					s.erase(mp(a[i - 1], i - 1));
				}
			}
			debug(mn, mn + 3 * n + 1);
			debug(mx, mx + 3 * n + 1);
			ans = ll(-1e18);
			forn (i, n, 2 * n + 1) {
				umx(ans, mx[i] - mn[i]);
			}
		}
		
		void clear () {
			*this = Solution();
		}
	};
}


Main::Solution sol;

int main () {
	cout.setf(ios::showpoint | ios::fixed);
	cout.precision(20);

	#ifdef SG
		freopen((problemname + ".in").c_str(), "r", stdin);
//		freopen((problemname + ".out").c_str(), "w", stdout);
		while (sol.read()) {
			sol.solve();
			sol.write();
			sol.clear();
		}
	#else
		sol.read();
		sol.solve();
		sol.write();
	#endif
	
	/*
	int t;
	cin >> t;
	forn (i, t) {
		sol.read();
		sol.solve();
		sol.write();
		sol.clear();
	}
	*/
	
	return 0;
}


Measured memory_bytes: 19456