#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma comment(linker, "/stack:200000000")

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;

#define X first
#define Y second

//#include <boost/unordered_map.hpp>
//using namespace boost;

/*
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;
rbtree T;
*/

namespace io{
	const int L = (1 << 20) + 1;

	char buf[L], *S , *T, c;

	char getchar() {
		if(__builtin_expect(S == T, 0)) {
			T = (S = buf) + fread(buf, 1, L, stdin);
			return (S == T ? EOF : *S++);
		}
		return *S++;
	}

	int inp() {
		int x = 0, f = 1; char ch;
		for(ch = getchar(); !isdigit(ch); ch = getchar())
			if(ch == '-') f = -1;
		for(; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return x * f;
	}

	unsigned inpu()
	{
		unsigned x = 0; char ch;
		for(ch = getchar(); !isdigit(ch); ch = getchar());
		for(; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return x;
	}

	ll inp_ll() {
		ll x = 0; int f = 1; char ch;
		for(ch = getchar(); !isdigit(ch); ch = getchar())
			if(ch == '-') f = -1;
		for(; isdigit(ch); x = x * 10 + ch - '0', ch = getchar());
		return x * f;
	}

	char B[45], *outs=B+40, *outr=B+40;
	template<class T>
	inline void print(register T a,register char x=0){
		if(x) *--outs = x, x = 0;

		if(!a)*--outs = '0';
		else
			while(a)
				*--outs = (a % 10) + 48, a /= 10;

		if(x)
			*--outs = x;

		fwrite(outs, outr - outs , 1, stdout);
		outs = outr;
	}
};

using io :: print;
using io :: inp;
using io :: inpu;
using io :: inp_ll;

using i32 = int;
using i64 = long long;
using u8 = unsigned char;
using u32 = unsigned;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;
//using i128 = __int128_t;
//using u128 = __uint128_t;
using i128 = i64;
using u128 = u64;

ll power(ll a, ll b, ll p)
{
	if (!b) return 1;
	ll t = power(a, b/2, p);
	t = t*t%p;
	if (b&1) t = t*a%p;
	return t;
}

ll exgcd(ll a, ll b, ll &x, ll &y)
{
	if (b == 0)
	{
		x = 1;
		y = 0;
		return a;
	}
	ll px, py;
	ll d = exgcd(b, a%b, px, py);
	x = py;
	y = px-a/b*py;
	return d;
}

template<class T>
inline void freshmin(T &a, const T &b)
{
	if (a > b) a = b;
}

template<class T>
inline void freshmax(T &a, const T &b)
{
	if (a < b) a = b;
}

const int MOD = 1000000007;
const int INF = 1000000000;
const int MAXN = 200010;
const int MAXK = 20;

int n;
int a[MAXN];
vector<int> pos, neg, zero, v;
vector<pii> ans;

void perform(int a, int b)
{
	ans.emplace_back(a, b);
}

void print()
{
	for (auto p : ans)
		printf("%d %d\n", p.X, p.Y);
}

void solve()
{
	sort(pos.begin(), pos.end());
	sort(neg.begin(), neg.end());
	if (neg.empty() && zero.empty())
	{
		int cur = pos[0];
		for (int i = 1; i < (int)pos.size()-1; ++ i)
		{
			perform(cur, pos[i]);
			cur -= pos[i];
		}
		perform(pos.back(), cur);
		cur = pos.back()-cur;
		printf("%d\n", cur);
		print();
	}
	else if (pos.empty() && zero.empty())
	{
		int cur = neg.back();
		for (int i = (int)neg.size()-2; i >= 0; -- i)
		{
			perform(cur, neg[i]);
			cur -= neg[i];
		}
		printf("%d\n", cur);
		print();
	}
	else
	{
		sort(a+1, a+n+1);
		for (int i = n-1; i >= 1 && a[i] > 0; -- i)
		{
			perform(a[1], a[i]);
			a[1] -= a[i];
		}
		for (int i = 1; i <= n-1 && a[i] <= 0; ++ i)
		{
			perform(a[n], a[i]);
			a[n] -= a[i];
		}
		printf("%d\n", a[n]);
		print();
	}
}

int main()
{
	
	n = inp();
	for (int i = 1; i <= n; ++ i)
	{
		a[i] = inp();
		if (a[i] > 0) pos.push_back(a[i]);
		if (a[i] < 0) neg.push_back(a[i]);
		if (a[i] == 0) zero.push_back(0);
	}
	solve();
	
	return 0;
}


Measured memory_bytes: 4340