#include <bits/stdc++.h>
#include <random>


using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;



#define int ll


typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<pii> vpi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;


#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define mp(a, b) make_pair(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << x << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif


void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
    cerr << *it << " = " << a << endl;
    err(++it, args...);
}

const double PI = 2 * acos(0.0);

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

istream &operator >> (istream &in, pii &a)
{
    in >> a.first >> a.second;
    return in;
}


ostream &operator << (ostream &out, pii &a)
{
    out << a.first << ' ' << a.second;
    return out;
}


template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
    return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
    return out << "{" << get<0>(a) << ", " << get<1>(a) <<
               ", " << get<2>(a) << ", " <<  get<3>(a) << "}";
}

template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
    out << "[";
    fori (i, a.size())
        out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
    return out;
}


void smain();

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

#ifdef ART_HOME
    freopen("input.txt", "r", stdin);
    clock_t start = clock();
#endif
    cout << setprecision(0) << fixed;
    smain();
#ifdef ART_HOME
    cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) /  CLOCKS_PER_SEC << endl;
#endif
}


const int N = 1 << 17, psze = 20, oo = 1e9 + 100, B = 100, M = 1e9 + 6;
const ld pi = 2 * atan2(1, 0), EPS = 1e-9;


pair<int, vpi> under(vi val)
{
    reverse(ALL(val));

    int M = 0;
    for (int v : val)
        M += -v;

    M += 2 * val[0];
//    cout << M << '\n';

    vpi ans;
    for (int i = 1; i < SZ(val); ++i)
    {
        ans.push_back(mp(val[0], val[i]));
//        cout << val[0] << ' ' << val[i] << '\n';
        val[0] -= val[i];
    }

    return mp(M, ans);
}


pair<int, vpi> above(vi val)
{
    int M = 0;
    for (int v : val)
        M += v;

    M -= 2 * val[0];
//    cout << M << '\n';

    vpi ans;

    for (int i = 1; i + 1 < SZ(val); ++i)
    {
//        cout << val[0] << ' ' << val[i] << '\n';
        ans.push_back(mp(val[0], val[i]));
        val[0] -= val[i];
    }

    ans.push_back(mp(val.back(), val[0]));
    return mp(M, ans);
}


void both(vi val)
{
    reverse(ALL(val));
    int M = 0;
    for (int v : val)
        M += abs(v);

    cout << M << '\n';

    for (int i = 0; i < SZ(val); ++i)
    {
        if (val[i] >= 0 && i + 1 != SZ(val) && val[i + 1] >= 0)
        {
            cout << val.back() << ' ' << val[i] << '\n';
            val.back() -= val[i];
        }
        else
        {
            for (int j = i + 1; j < SZ(val); ++j)
            {
                cout << val[i] << ' ' << val[j] << '\n';
                val[i] -= val[j];
            }

            return;
        }
    }
}


void smain() {
    int n;
    cin >> n;

    vi val(n);
    for (int i = 0; i < n; ++i)
        cin >> val[i];

    stable_sort(ALL(val));
    pair<int, vpi> ans;

    if (val.back() <= 0)
        ans = under(val);
    else if (val[0] >= 0)
        ans = above(val);
    else
    {
        both(val);
        return;
    }

    cout << ans.first << '\n';
    for (auto p : ans.second)
        cout << p.first << ' ' << p.second << '\n';
}

Measured memory_bytes: 6004