Problem:
Score : 500 points

Problem 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.

Constraints

2 \leq N \leq 10^5

-10^4 \leq A_i \leq 10^4

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

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}

Sample Input 1

3
1 -1 2

Sample Output 1

4
-1 1
2 -2

If we choose x = -1 and y = 1 in the first operation, the set of integers written on the blackboard becomes (-2, 2).

Then, if we choose x = 2 and y = -2 in the second operation, the set of integers written on the blackboard becomes (4).

In this case, we have 4 as the final integer. We cannot end with a greater integer, so the answer is 4.

Sample Input 2

3
1 1 1

Sample Output 2

1
1 1
1 0

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let n = get!(usize);
    let mut a = get!([isize]);

    let mut minus = Vec::new();
    let mut plus = Vec::new();
    let mut zflag = false;
    for &e in &a {
        if e < 0 {
            minus.push(e);
        } else if e == 0 {
            zflag = true;
            plus.push(e);
        } else {
            plus.push(e);
        }
    }

    if plus.len() == 0 {
        minus.sort();
        let mut now = minus.pop().unwrap();
        println!("{}", now - minus.iter().sum::<isize>());
        for e in minus.into_iter().rev() {
            println!("{} {}", now, e);
            now -= e;
        }
        return;
    } else if minus.len() == 0 {
        if zflag {
            plus.sort();
            println!("{}", plus.iter().sum::<isize>());
            let last = plus.pop().unwrap();
            plus.remove(0);
            let mut now = 0;
            for e in plus.into_iter() {
                println!("{} {}", now, e);
                now -= e;
            }
            println!("{} {}", last, now);
            return;
        }
            
        a.sort();
        if n % 2 == 0 {
            let mut vec = Vec::new();
            for i in 0..n/2 {
                vec.push(a[i]);
                vec.push(a[n-i-1]);
            }
            println!("{}", a.iter().skip(n/2).sum::<isize>()-a.iter().take(n/2).sum::<isize>());
            let mut now = vec[0];
            for i in 1..n {
                println!("{} {}", vec[i], now);
                now = vec[i]-now;
            }
        } else {
            let mut vec = Vec::new();
            for i in 0..n/2 {
                vec.push(a[n-i-1]);
                vec.push(a[i]);
            }
            println!("{}", a.iter().skip(n/2+1).sum::<isize>()-a.iter().take(n/2).sum::<isize>()+a[n/2]);
            let mut now = vec[0];
            for i in 1..n-1 {
                println!("{} {}", vec[i], now);
                now = vec[i]-now;
            }
            println!("{} {}", a[n/2], now);
        }
        return;
    }

    println!("{}", plus.iter().sum::<isize>()-minus.iter().sum::<isize>());

    let mut now = minus.pop().unwrap();
    for &e in plus.iter().skip(1) {
        println!("{} {}", now, e);
        now -= e;
    }
    println!("{} {}", plus[0], now);
    now = plus[0]-now;
    for e in minus {
        println!("{} {}", now, e);
        now -= e;
    }
}