output_description: Print the maximum possible value M of the final integer on the blackboard, and
  a sequence of operations x_i, y_i that maximizes the final integer, in the
  format below.
  
  Here x_i and y_i represent the integers x and y chosen in the i-th operation,
  respectively.
  
  If there are multiple sequences of operations that maximize the final integer,
  any of them will be accepted.
  
      
      
      M
      x_1 y_1
      :
      x_{N-1} y_{N-1}
      
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      A_1 A_2 ... A_N
attempt: def getN():
      return int(input())
  
  
  def getMN():
      return list(map(int, input().split()))
  
  
  def getlist():
      return list(map(int, input().split()))
  
  
  import sys
  
  n = getN()
  nums = getlist()
  nums.sort()
  
  from bisect import bisect_left
  
  insert = bisect_left(nums, 0)
  
  
  if insert == 0:
      print(sum(nums) - 2 * nums[0])
      tmp = nums[0]
      for num in nums[1:-1]:
          print(tmp, num)
          tmp = tmp - num
      print(nums[-1], tmp)
      sys.exit()
  
  if insert == len(nums):
      nums.sort(reverse=True)
      print(abs(sum(nums)) + 2 * nums[0])
      tmp = nums[0]
      for num in nums[1:]:
          print(tmp, num)
          tmp = tmp - num
      sys.exit()
  
  neg = nums[:insert]
  pos = nums[insert:]
  neg_end = neg[0]
  pos_end = pos[-1]
  print(abs(sum(neg)) + sum(pos))
  for ne in neg[1:]:
      print(pos_end, ne)
      pos_end -= ne
  
  for po in pos[:-1]:
      print(neg_end, po)
      neg_end -= po
  
  print(pos_end, neg_end)
  
  
  """
  5
  8 9 -2 -3 10
  """
  
problem_description: Statement
  
  There are N integers, A_1, A_2, ..., A_N, written on a blackboard.
  
  We will repeat the following operation N-1 times so that we have only one
  integer on the blackboard.
  
    * Choose two integers x and y on the blackboard and erase these two integers. Then, write a new integer x-y.
  
  Find the maximum possible value of the final integer on the blackboard and a
  sequence of operations that maximizes the final integer.
samples: [{"input": "3\n    1 -1 2", "output": "4\n    -1 1\n    2 -2\n    \n\nIf we choose x = -1 and y = 1 in the first operation, the set of integers\nwritten on the blackboard becomes (-2, 2).\n\nThen, if we choose x = 2 and y = -2 in the second operation, the set of\nintegers written on the blackboard becomes (4).\n\nIn this case, we have 4 as the final integer. We cannot end with a greater\ninteger, so the answer is 4.\n\n* * *"}, {"input": "3\n    1 1 1", "output": "1\n    1 1\n    1 0"}]