object Main {
  import java.io.{BufferedReader, InputStream, InputStreamReader}
  import java.util.StringTokenizer
  import scala.reflect.ClassTag

  def main(args: Array[String]): Unit = {
    val out = new java.io.PrintWriter(System.out)
    new Main(out, new InputReader(System.in)).solve()
    out.flush()
  }

  private val oj = System.getenv("ATCODER_DEBUG") == null
  def DEBUG(f: => Unit): Unit = {
    if (!oj){ f }
  }
  def debug(as: Array[Boolean]): Unit = if (!oj){ debug(as.map(x => if(x) "1" else "0").mkString) }
  def debug(as: Array[Int]): Unit = if (!oj){ debug(as.mkString(" ")) }
  def debug(as: Array[Long]): Unit =if (!oj){ debug(as.mkString(" ")) }
  def debugDim(m: Array[Array[Int]]): Unit = if (!oj){
    REP(m.length) { i =>
      debug(m(i))
    }
  }
  def debugDimFlip(m: Array[Array[Long]]): Unit = if (!oj){
    REP(m(0).length) { j =>
      REP(m.length) { i =>
        System.err.print(m(i)(j))
        System.err.print(" ")
      }
      System.err.println()
    }
  }
  def debug(s: => String): Unit = DEBUG {
    System.err.println(s)
  }
  def debugL(num: => Long): Unit = DEBUG {
    System.err.println(num)
  }

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

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

    def nextInt(): Int = Integer.parseInt(next())
    def nextLong(): Long = java.lang.Long.parseLong(next())
    def nextChar(): Char = next().charAt(0)

    def ni(): Int = nextInt()
    def nl(): Long = nextLong()
    def nc(): Char = nextChar()
    def ns(): String = next()
    def ns(n: Int): Array[Char] = ns().toCharArray
    def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset)
    def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = {
      val A1, A2 = Array.ofDim[Int](n)
      REP(n) { i =>
        A1(i) = ni() + offset
        A2(i) = ni() + offset
      }
      (A1, A2)
    }
    def nm(n: Int, m: Int): Array[Array[Int]] = {
      val A = Array.ofDim[Int](n, m)
      REP(n) { i =>
        REP(m) { j =>
          A(i)(j) = ni()
        }
      }
      A
    }
    def nal(n: Int): Array[Long] = map(n)(_ => nl())
    def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  }

  def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }
  def TO(from: Int, to: Int)(f: Int => Unit): Unit = {
    REP(to - from + 1, from) { i =>
      f(i)
    }
  }
  def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    REP(n)(i => res(i) = f(i + offset))
    res
  }

  def sumL(as: Array[Int]): Long = {
    var s = 0L
    REP(as.length)(i => s += as(i))
    s
  }
  def cumSum(as: Array[Int]): Array[Long] = {
    val cum = Array.ofDim[Long](as.length + 1)
    REP(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}

case class Ans(a: Long, b: Long)

class Main(out: java.io.PrintWriter, sc: Main.InputReader) {
  import sc._
  import Main._
  import java.util.Arrays.sort

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

  // toIntとか+7とかするならvalにしろ
  @inline private def MOD = 1000000007

  def solve(): Unit = {
    val N = ni()
    val A = na(N)
    val neg = A.count(_ < 0)

    val ans = ArrayBuffer[Ans]()
    var x = 0L

    if (N == 2) {
      val a = A(0)
      val b = A(1)
      if (a > b) {
        out.println(a - b)
        out.println(s"$a $b")
      } else {
        out.println(b - a)
        out.println(s"$b $a")
      }

      return
    }

    if (neg == 0) {
      sort(A)
      ans += Ans(A(0), A(1))
      x = A(0) - A(1)
      REP(N - 3, 2) { i =>
        ans += Ans(x, A(i))
        x = x - A(i)
      }
      ans += Ans(A(N - 1), x)
      x = A(N - 1) - x

    } else if (N == neg) {
      sort(A)
      ans += Ans(A(N - 1), A(N - 2))
      x = A(N - 1) - A(N - 2)
      REP_r(N - 2) { i =>
        ans += Ans(x, A(i))
        x = x - A(i)
      }
    } else {
      import java.util
      val Pos, Neg = new util.ArrayDeque[Int]
      REP(N) { i =>
        if (A(i) >= 0) Pos.add(A(i))
        else Neg.add(A(i))
      }

      def add(a: Long, b: Long): Unit = {
        x = b - a
        // この先にPosがあるようだとxをマイナスにする
        if (!Pos.isEmpty) {
          if (x >= 0) {
            ans += Ans(a, b)
            x *= -1
          } else {
            ans += Ans(b, a)
          }
        } else {
          // Negしかないようならxをプラスにする
          if (x < 0) {
            ans += Ans(a, b)
            x *= -1
          } else {
            ans += Ans(b, a)
          }
        }
      }
      add(Pos.poll(), Neg.poll())

      def addFromQueue(): Unit = {
        if (!Pos.isEmpty) add(x, Pos.poll())
        else if (!Neg.isEmpty) add(x, Neg.poll())
      }

      REP(N - 3) { _ =>
        addFromQueue()
      }

      addFromQueue()
    }

    out.println(x)
    REP(ans.length) { i =>
      out.println(s"${ans(i).a} ${ans(i).b}")
    }
  }
}

Measured memory_bytes: 57956