#include <cstdio>

#include <iostream>
#include <queue>
#include <vector>

using namespace std;

const int MAXN = 1000100;
const long long INF = 0x3f3f3f3f3f3f3f3f;

struct node {
    long long v;
    int ch[2];
} node[2 * MAXN];

int n, l[2], r[2];
int q[2][MAXN], depth[MAXN];
long long code[MAXN], total_sum;

void traverse(int pos, int val, int d)
{
    if (node[pos].ch[0]) {
        traverse(node[pos].ch[0], val * 2, d + 1);
        traverse(node[pos].ch[1], val * 2 + 1, d + 1);
    } else {
        depth[pos] = d;
        code[pos] = val;
    }
}

void huffman_code()
{
    int k = n;
    l[0] = l[1] = 1;
    r[0] = n;
    while (l[0] + l[1] <= r[0] + r[1]) {
        ++k;
        for (int j = 0; j < 2; ++j) {
            int p = 0;
            long long minim = INF;
            for (int i = 0; i < 2; ++i) {
                if (node[q[i][l[i]]].v < minim && l[i] <= r[i]) {
                    p = i;
                    minim = node[q[i][l[i]]].v;
                }
            }
            node[k].ch[j] = q[p][l[p]];
            node[k].v += node[q[p][l[p]]].v;
            l[p]++;
        }
        total_sum += node[k].v;
        q[1][++r[1]] = k;
    }
    traverse(k, 0, 0);
}

int main()
{
    freopen("huffman.in", "r", stdin);
    freopen("huffman.out", "w", stdout);

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

    huffman_code();
    printf("%lld\n", total_sum);
    for (int i = 1; i <= n; ++i)
        printf("%d %lld\n", depth[i], code[i]);

    return 0;
}