#include <bits/stdc++.h>
#define range(i, l, r) for(long long int (i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int (i) = (r) - 1; (i) >= l; (i)--)
using namespace std;
template <typename T>
using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;

template <typename S, typename T>
ostream& operator <<(ostream& os, pair<S, T> p) {
    os << "(";
    os << p.first << ", " << p.second;
    return os << ")";
}

template <typename T>
ostream& operator <<(ostream& os, vec<T> v) {
    os << "[";
    if (v.size() == 0) return os << "]";
    for (int i = 0; i < v.size() - 1; i++) {
        os << v.at(i) << ", ";
    }
    return os << v.at(v.size() - 1) << "]";
}

template <typename T>
ostream& operator <<(ostream& os, set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename T>
ostream& operator <<(ostream& os, unordered_set<T>& s) {
    os << "{";
    if (s.begin() == s.end()) return os << "}";
    auto it_first_item = s.begin();
    cout << *it_first_item;
    for (auto it = ++it_first_item; it != s.end(); it++) {
        cout << ", " << *it;
    }
    return cout << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

template <typename K, typename V>
ostream& operator <<(ostream& os, unordered_map<K, V> m) {
    os << "{";
    if (m.begin() == m.end()) return os << "}";
    auto it_first_item = m.begin();
    cout << it_first_item->first << ": " << it_first_item->second;
    for (auto it = ++it_first_item; it != m.end(); it++) {
        cout << ", " << it->first << ": " << it->second;
    }
    return os << "}";
}

lint pow(lint num, lint e, lint MOD) {
    lint res = 1;
    lint cur_num = num;
    while (e) {
        if (e & 1) {
            res *= cur_num;
            res %= MOD;
        }
        cur_num *= cur_num;
        cur_num %= MOD;
        e >>= 1;
    }
    return res;
}

int main() {
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    lint N; cin >> N;
    vec<lint> positives, negatives;
    range(i, 0, N) {
        lint A; cin >> A;
        if (A >= 0) positives.emplace_back(A);
        else negatives.emplace_back(A);
    }
    sort(negatives.begin(), negatives.end(), greater<lint>());
    sort(positives.begin(), positives.end());
    if (positives.empty()) {
        lint res = 2 * negatives.at(0);
        range(i, 0, N) res -= negatives.at(i);
        cout << res << "\n";
        while (negatives.size() > 1) {
            lint front = negatives.at(0);
            lint back = negatives.at(negatives.size() - 1);
            negatives.pop_back();
            cout << front << " " << back << "\n";
            negatives.at(0) -= back;
        }
    } else if (negatives.empty()) {
        lint res = -2 * positives.at(0);
        range(i, 0, N) res += positives.at(i);
        cout << res << "\n";
        lint max_val = positives.at(positives.size() - 1);
        positives.pop_back();
        while (positives.size() > 1) {
            lint front = positives.at(0);
            lint back = positives.at(positives.size() - 1);
            positives.pop_back();
            cout << front << " " << back << "\n";
            positives.at(0) -= back;
        }
        cout << max_val << " " << positives.at(0) << "\n";
    } else {
        lint res = 0;
        for (const lint& neg : negatives) res -= neg;
        for (const lint& pos : positives) res += pos;
        cout << res << "\n";
        while (negatives.size() > 1) {
            lint back = negatives.at(negatives.size() - 1);
            lint pos_front = positives.at(0);
            cout << pos_front << " " << back << "\n";
            negatives.pop_back();
            positives.at(0) -= back;
        }
        lint max_val = positives.at(positives.size() - 1);
        positives.pop_back();
        while (positives.size() > 0) {
            lint back = positives.at(positives.size() - 1);
            lint neg_front = negatives.at(0);
            cout << neg_front << " " << back << "\n";
            positives.pop_back();
            negatives.at(0) -= back;
        }
        cout << max_val << " " << negatives.at(0) << "\n";
    }
}

Measured memory_bytes: 2804