#include <cstdio>

using namespace std;

#define INF 1LL * 1000000000 * 1000000000
#define NMAX 1000100

long n, i, j, k, p, l[2], r[2];
long q[2][NMAX], lg[NMAX];
long long b[NMAX], m, sol;

struct nod
{
	long long v;
	long f[2];
} nod[2 * NMAX];

void ReadData ()
{
	scanf ("%d", &n);
	for (i = 1; i <= n; ++i)
	{
		scanf ("%d", &nod[i].v);
		q[0][i] = i;
	}
}

void DF (long poz, long long cod, long nivel)
{
	if (nod[poz].f[0])
	{
		DF (nod[poz].f[0], cod * 2, nivel + 1);
		DF (nod[poz].f[1], cod * 2 + 1, nivel + 1);
		return;
	}
	lg[poz] = nivel;
	b[poz] = cod;
}

void Solve ()
{
	k = n;
	l[0] = l[1] = 1;
	r[0] = n;
	while (l[0] + l[1] <= r[0] + r[1])
	{
		++k;
		for (j = 0; j < 2; ++j)
		{
			p = 0;
			m = INF;
			for (i = 0; i < 2; ++i)
			{
				if (nod[q[i][l[i]]].v < m && l[i] <= r[i])
				{
					p = i;
					m = nod[q[i][l[i]]].v;
				}
			}
			nod[k].f[j] = q[p][l[p]];
			nod[k].v += nod[q[p][l[p]]].v;
			l[p]++;
		}
		sol += nod[k].v;
		q[1][++r[1]] = k;
	}
	DF (k, 0, 0);
}

void WriteData ()
{
	printf ("%lld\n", sol);
	for (i = 1; i <= n; ++i)
		printf ("%d %lld\n", lg[i], b[i]);
}

int main ()
{
	freopen ("huffman.in", "r", stdin);
	freopen ("huffman.out", "w", stdout);
	ReadData ();
	Solve ();
	WriteData ();
	return 0;
}