#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>

#ifdef LOCAL
    #define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
    #define eprintf(...)
#endif

#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) for (int i = (b-1), i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fls(x) (64 - __builtin_clzll(x))
#define pcnt(x) __builtin_popcountll(x)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair <ll,int> P;
typedef long double ld;

template< typename Monoid >
struct SegmentTree {
    using F = function< Monoid(Monoid, Monoid) >;
    int sz;
    vector< Monoid > seg;
    const F f;
    const Monoid M1;
    SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1) {
        sz = 1;
        while(sz < n) sz <<= 1;
        seg.assign(2 * sz, M1);
    }
    void set(int k, const Monoid &x) {
        seg[k + sz] = x;
    }
    void build() {
        for(int k = sz - 1; k > 0; k--) {
            seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
        }
    }
    void update(int k, const Monoid &x) {
        k += sz;
        seg[k] = x;
        while(k >>= 1) {
            seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
        }
    }
    Monoid query(int a, int b) {
        Monoid L = M1, R = M1;
        for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
            if(a & 1) L = f(L, seg[a++]);
            if(b & 1) R = f(seg[--b], R);
        }
        return f(L, R);
    }
    Monoid operator[](const int &k) const {
        return seg[k + sz];
    }
    template< typename C >
    int find_subtree(int a, const C &check, Monoid &M, bool type) {
        while(a < sz) {
            Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
            if(check(nxt)) a = 2 * a + type;
            else M = nxt, a = 2 * a + 1 - type;
        }
        return a - sz;
    }
    template< typename C >
    int find_first(int a, const C &check) {
        Monoid L = M1;
        if(a <= 0) {
            if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);
            return -1;
        }
        int b = sz;
        for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
            if(a & 1) {
                Monoid nxt = f(L, seg[a]);
                if(check(nxt)) return find_subtree(a, check, L, false);
                L = nxt;
                ++a;
            }
        }
        return -1;
    }
    template< typename C >
    int find_last(int b, const C &check) {
        Monoid R = M1;
        if(b >= sz) {
            if(check(f(seg[1], R))) return find_subtree(1, check, R, true);
            return -1;
        }
        int a = sz;
        for(b += sz; a < b; a >>= 1, b >>= 1) {
            if(b & 1) {
                Monoid nxt = f(seg[--b], R);
                if(check(nxt)) return find_subtree(b, check, R, true);
                R = nxt;
            }
        }
        return -1;
    }
};

void mysort (vector<P> &foo, bool x) {
    sort(all(foo), [&](P a, P b){return x ? (a.first > b.first) : (a.first < b.first);});
    rep (i, foo.size()) foo[i].first = i;
    sort(all(foo), [&](P a, P b){return (x) ? (a.second < b.second) : (a.second > b.second);});
}

int main (void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n; cin >> n;
    vector<ll> a(3 * n); rep (i, a.size()) cin >> a[i];
    vector<ll> l(n + 1), r(n + 1);
    vector<P> li(2 * n), ri(2 * n);
    SegmentTree<int> sl(2 * n, [](int a, int b){return max(a, b);}, -1);
    SegmentTree<int> sr(2 * n, [](int a, int b){return max(a, b);}, -1);
    ll suml = 0, sumr = 0;
    map<int, int> lm, rm;

    rep (i, li.size()) li[i] = {a[i], i};
    mysort(li, true);
    rep (i, li.size()) eprintf("(%lld,%d)%c", li[i].first, li[i].second, " \n"[i == i_len - 1]);
    for (auto [i, j] : li) lm[i] = j;
    rep (i, 2 * n) sl.update(i, li[i].first);
    rep (i, n) suml += a[i];
    l[0] = suml;
    rep (i, n) {
        int k = lm[sl.query(0, n + 1 + i)];
        eprintf("%d %lld %lld\n", k, a[n+i], a[k]);
        l[i + 1] = (suml += a[n + i] - a[k]);
        sl.update(k, -1);
    }
    rep (i, n + 1) eprintf("%lld%c", l[i], " \n"[i == i_len - 1]);

    rep (i, ri.size()) ri[i] = {a[n + i], n + i};
    mysort(ri, false);
    rep (i, ri.size()) eprintf("(%lld,%d)%c", ri[i].first, ri[i].second, " \n"[i == i_len - 1]);
    for (auto [i, j] : ri) rm[i] = j;
    rep (i, 2 * n) sr.update(i, ri[i].first);
    rep (i, n) sumr += a[3 * n - 1 - i];
    r[0] = sumr;
    rep (i, n) {
        int k = rm[sr.query(0, n + 1 + i)];
        eprintf("%d %lld %lld\n", k, a[2*n-1-i], a[k]);
        r[i + 1] = (sumr += a[2 * n - 1 - i] - a[k]);
        sr.update(3 * n - 1 - k, -1);
    }
    rep (i, n + 1) eprintf("%lld%c", r[i], " \n"[i == i_len - 1]);

    ll ans = -(ll)1e18;
    rep (i, n + 1) {
        eprintf("%lld %lld\n", l[i], r[n - i]);
        chmax(ans, l[i] - r[n - i]);
    }
    cout << ans << "\n";
    return 0;
}

Measured memory_bytes: 36156