import java.io.{BufferedReader, InputStream, InputStreamReader}
import java.util.StringTokenizer

import scala.collection.mutable
import scala.util.Sorting
import math.{abs, max, min}

object Main {
  val MOD = 1000000007
  def solve(): Unit = {
    val sc = new InputReader(System.in)
    val N = sc.nextInt()

    var L: Long = 0
    val left = mutable.PriorityQueue[Long]()(Ordering[Long].reverse)
    (0 until N) foreach { _ =>
      val a = sc.nextLong()
      left.enqueue(a)
      L += a
    }

    val mid = Array.fill[Long](N)(sc.nextLong())

    var R: Long = 0
    val right = mutable.PriorityQueue[Long]()
    (0 until N) foreach { _ =>
      val a = sc.nextLong()
      right.enqueue(a)
      R += a
    }

    val dL = Array.ofDim[Long](N + 1)
    dL(0) = L
    val dR = Array.ofDim[Long](N + 1)
    dR(N) = R

    (0 until N) foreach { i =>
      val add = mid(i)
      left.enqueue(add)
      val remove = left.dequeue()
      dL(i + 1) = dL(i) + add - remove
    }

    (0 until N) foreach { j =>
      val i = N - 1 - j
      val add = mid(i)
      right.enqueue(add)
      val remove = right.dequeue()
      dR(i) = dR(i + 1) + add - remove
    }

    val ans = (dL zip dR map { case (l, r) => l - r }).max

    println(ans)
  }


  def main(args: Array[String]): Unit = {
    solve()
  }


  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = null

    def next: String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = next.toInt
    def nextLong(): Long = next.toLong
    def nextChar(): Char = next.charAt(0)
  }

}
