#include <cstdio>

using namespace std;

struct nod{
    long long x;
    int f[2];
}nod[2000005];

int n, q[2][1000005], l[2], r[2], lg[1000005];
long long sol, cd[1000005];

void dfs(int poz, int cod, int level)
{
    if(nod[poz].f[0]){
        dfs(nod[poz].f[0], cod*2, level+1);
        dfs(nod[poz].f[1], cod*2+1, level+1);
    }else{
        lg[poz] = level;
        cd[poz] = cod;
    }
}

int main()
{
    //ifstream fin ("huffman.in");
    //ofstream fout ("huffman.out");
    freopen("huffman.in", "r", stdin);
    freopen("huffman.out", "w", stdout);
    //fin >> n;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i){
        //fin >> nod[i].x;
        scanf("%d", &nod[i].x);
        q[0][i] = i;
    }
    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 m = 9223372036854775807LL;
            for (int i = 0; i < 2; ++i)
                if(l[i] <= r[i] && nod[q[i][l[i]]].x < m){
                    p = i;
                    m = nod[q[i][l[i]]].x;
                }
            nod[k].f[j] = q[p][l[p]];
            nod[k].x += nod[q[p][l[p]]].x;
            ++l[p];
        }
        sol += nod[k].x;
        q[1][++r[1]] = k;
    }
    dfs(k, 0, 0);
    //fout << sol << "\n";
    printf("%lld\n", sol);
    for (int i = 1; i <= n; ++i)
        //fout << lg[i] << " " << cd[i] << "\n";
        printf("%d %lld\n", lg[i], cd[i]);
    //fin.close();
    //fout.close();
    return 0;
}