#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "------------------------\n" 
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause") //comment out this on AOJ.
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10; //1e-9?
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }

template<class T> class segtree {
    int n = 1;
    vector<T> dat;
    T def;

public:
    segtree(int _n, T _def) : def(_def) {
        while (n < _n)n *= 2;
        dat.resize(2 * n, def);
    }
    segtree(vector<T> a, T _def) : def(_def) {
        int _n = a.size();
        while (n < _n)n *= 2;
        dat.resize(2 * n, def);
        FOR(i, 0, _n)dat[i + n] = a[i];
        rFOR(i, 1, n)dat[i] = fun(dat[2 * i], dat[2 * i + 1]);
    }

    T fun(T x, T y) { return x + y; }

    void update(int i, T a) {
        i += n;
        dat[i] += a;
        while (i > 1) {
            i /= 2;
            dat[i] = fun(dat[2 * i], dat[2 * i + 1]);
        }
    }

    T value(int l, int r) {
        l += n, r += n;

        T ret = def;
        for (; l < r; l /= 2, r /= 2) {
            if (l & 1) {
                ret = fun(ret, dat[l]);
                l++;
            }
            if (r & 1) {
                --r;
                ret = fun(ret, dat[r]);
            }
        }

        return ret;
    }

    T operator[](int k) { return dat[k + n]; }
};

int main() {
    init();

    int n; cin >> n;
    VL a(3 * n); cin >> a;

    vector<pair<ll, int>> m;
    FOR(i, 0, 3 * n)m.emplace_back(a[i], i);
    SORT(m);
    map<pair<ll, int>, int> rev;
    FOR(i, 0, 3 * n)rev[m[i]] = i;

    segtree<int> cnt1(3 * n, 0), cnt2(3 * n, 0);
    segtree<ll> x(3 * n, 0), y(3 * n, 0);
    FOR(i, 0, n) {
        cnt1.update(rev[make_pair(a[i], i)], 1);
        x.update(rev[make_pair(a[i], i)], a[i]);
    }
    FOR(i, n, 3 * n) {
        cnt2.update(rev[make_pair(a[i], i)], 1);
        y.update(rev[make_pair(a[i], i)], a[i]);
    }

    ll ans = -LLINF;
    FOR(i, n - 1, 2 * n) {
        if (n <= i) {
            cnt1.update(rev[make_pair(a[i], i)], 1);
            x.update(rev[make_pair(a[i], i)], a[i]);
            cnt2.update(rev[make_pair(a[i], i)], -1);
            y.update(rev[make_pair(a[i], i)], -a[i]);
        }

        ll sum = 0;
        {
            int ok = -1, ng = 3 * n;
            while (ng - ok > 1) {
                int mid = (ok + ng) / 2;
                if (n <= cnt1.value(mid, 3 * n))ok = mid;
                else ng = mid;
            }
            sum += x.value(ok, 3 * n);
        }
        {
            int ok = 3 * n, ng = -1;
            while (ok - ng > 1) {
                int mid = (ok + ng) / 2;
                if (n <= cnt2.value(0, mid))ok = mid;
                else ng = mid;
            }
            sum -= y.value(0, ok);
        }
        chmax(ans, sum);
    }

    cout << ans << "\n";
}

Measured memory_bytes: 52584