using System;
using System.IO;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text;
using E = System.Linq.Enumerable;

partial class Solver
{

    static public void Swap<T>(ref T a, ref T b)
    {
        T t = a;
        a = b;
        b = t;
    }
    public void Run()
    {
        var N = ni();
        var A = nl(N);
        Array.Sort(A);

        var step = new List<string>();

        var sum = new long[N];

        Swap(ref A[1], ref A[A.Length - 1]);

        sum[1] = Math.Abs(A[1] - A[0]);

        for (int i = 2; i < N; i++)
        {
            sum[i] = Math.Max(Math.Abs(sum[i - 1] - A[i]), Math.Abs(-sum[i - 1] - A[i]));
        }

        long ans = sum.Last();
        long maxValue = ans;
        for (int i = N - 1; i >= 2; i--)
        {
            // preX - preY = ans
            long preX = -1, preY = -1;
            if (sum[i - 1] - A[i] == ans)
            {
                ans = sum[i - 1];
                preX = sum[i - 1];
                preY = A[i];
            }
            else if (A[i] - sum[i - 1] == ans)
            {
                ans = sum[i - 1];
                preX = A[i];
                preY = sum[i - 1];
            }
            else if (-sum[i - 1] - A[i] == ans)
            {
                ans = -sum[i - 1];
                preX = -sum[i - 1];
                preY = A[i];
            }
            else if (A[i] - (-sum[i - 1]) == ans)
            {
                ans = -sum[i - 1];
                preX = A[i];
                preY = -sum[i - 1];
            }
            else throw new Exception();
            step.Add(string.Format("{0} {1}", preX, preY));
        }

        if (A[0] - A[1] == ans)
        {
            step.Add(string.Format("{0} {1}", A[0], A[1]));
        }
        else if (A[1] - A[0] == ans)
        {
            step.Add(string.Format("{0} {1}", A[1], A[0]));
        }
        else throw new Exception();

        cout.WriteLine(maxValue);
        step.Reverse();
        foreach (var line in step)
        {
            cout.WriteLine(line);
        }
    }
}

// PREWRITEN CODE BEGINS FROM HERE
partial class Solver : Scanner
{
    public static void Main(string[] args)
    {
#if LOCAL
        new Solver(Console.In, Console.Out).Run();
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader)
    {
        this.cin = reader;
        this.cout = writer;
    }
    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer)
    {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

public static class LinqPadExtension
{
    static public T Dump<T>(this T obj)
    {
#if LOCAL
        return LINQPad.Extensions.Dump(obj);
#else
        return obj;
#endif
    }
}
public class Scanner
{
    private readonly TextReader Reader;
    private readonly Queue<string> TokenQueue = new Queue<string>();
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    public Scanner()
        : this(Console.In)
    {
    }

    public Scanner(TextReader reader)
    {
        this.Reader = reader;
    }

    public int NextInt() { return int.Parse(Next(), ci); }
    public long NextLong() { return long.Parse(Next(), ci); }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size)
    {
        var array = new string[size];
        for (int i = 0; i < size; i++) array[i] = Next();
        return array;
    }
    public int[] NextIntArray(int size)
    {
        var array = new int[size];
        for (int i = 0; i < size; i++) array[i] = NextInt();
        return array;
    }

    public long[] NextLongArray(int size)
    {
        var array = new long[size];
        for (int i = 0; i < size; i++) array[i] = NextLong();
        return array;
    }

    public double[] NextDoubleArray(int size)
    {
        var array = new double[size];
        for (int i = 0; i < size; i++) array[i] = NextDouble();
        return array;
    }

    public string Next()
    {
        if (TokenQueue.Count == 0)
        {
            if (!StockTokens()) throw new InvalidOperationException();
        }
        return TokenQueue.Dequeue();
    }

    public bool HasNext()
    {
        if (TokenQueue.Count > 0)
            return true;
        return StockTokens();
    }
    static readonly char[] _separator = new[] { ' ' };
    private bool StockTokens()
    {
        while (true)
        {
            var line = Reader.ReadLine();
            if (line == null) return false;
            var tokens = line.Split(_separator, StringSplitOptions.RemoveEmptyEntries);
            if (tokens.Length == 0) continue;
            foreach (var token in tokens)
                TokenQueue.Enqueue(token);
            return true;
        }
    }
}


Measured memory_bytes: 34900