using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int N = cin.nextint;
        var A = cin.scanint;


        Array.Sort(A);
        var P = new SB();
        long start = A[N - 1];
        long last = A[0];
        for (int i = 1; i < N - 1; i++)
        {
            if (A[i] < 0)
            {
                P.AppendLine($"{start} {A[i]}");
                start = start - A[i];
            }
            else
            {
                P.AppendLine($"{last} {A[i]}");
                last = last - A[i];
            }
        }
        P.AppendLine($"{start} {last}");
        long final = start - last;
        WriteLine(final);
        Write(P);



        //if ((N - 1) % 2 == 0)
        //{
        //    long before = A[N - 1];
        //    int small = 0;
        //    int big = N - 2;
        //    var SB = new SB();
        //    for (int i = 1; i < N; i++)
        //    {
        //        if (i % 2 == 1)
        //        {
        //            SB.AppendLine($"{A[small]} {before}");
        //            before = A[small] - before;
        //            small++;
        //        }
        //        else
        //        {
        //            SB.AppendLine($"{A[big]} {before}");
        //            before = A[big] - before;
        //            big--;
        //        }
        //    }




        //    WriteLine(before);
        //    Write(SB);


        //}
        //else
        //{
        //    long before = A[0];
        //    int small = 1;
        //    int big = N - 1;
        //    var SB = new SB();

        //    for (int i = 1; i < N; i++)
        //    {
        //        if (i % 2 == 0)
        //        {
        //            SB.AppendLine($"{A[small]} {before}");

        //            before = A[small] - before;
        //            small++;
        //        }
        //        else
        //        {
        //            SB.AppendLine($"{A[big]} {before}");

        //            before = A[big] - before;
        //            big--;
        //        }
        //    }
        //    WriteLine(before);
        //    Write(SB);
        //}



    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}


Measured memory_bytes: 36556