#include <bits/stdc++.h>
using namespace std;
const int maxN=1e6+5;
const long long INF=(1LL<<60);

struct nod{
    long long val;
    int sons[2];
}v[2*maxN];

int n;

int st[2],dr[2];
long long sol;
long long Que[2][maxN];
long long len[maxN],codes[maxN];

void dfs(int nod,long long cod,int dep)
{
    if(v[nod].sons[0]!=0){
        dfs(v[nod].sons[0],(cod<<1),dep+1);
        dfs(v[nod].sons[1],(cod<<1)|1,dep+1);
    }

    if(nod<=n){
        len[nod]=dep;
        codes[nod]=1LL*cod;
        //cerr<<codes[nod]<<" ";
    }
}

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

    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&v[i].val);

    int curr=n;
    for(int i=1;i<=n;i++)
        Que[0][i]=i;

    st[0]=st[1]=1;
    dr[0]=n;
    long long minn=INF;
    int which_que=0;

    while(st[0]+st[1] <= dr[0]+dr[1])
    {
        curr++;
        for(int i=0;i<2;i++){
            which_que=0;
            minn=INF;

            if(v[Que[0][st[0]]].val<minn && st[0]<=dr[0]){
                minn=v[Que[0][st[0]]].val;
                which_que=0;
            }
            if(v[Que[1][st[1]]].val<minn && st[1]<=dr[1]){
                minn=v[Que[1][st[1]]].val;
                which_que=1;
            }

            v[curr].sons[i]=Que[which_que][st[which_que]];
            v[curr].val+=v[Que[which_que][st[which_que]]].val;

            st[which_que]++;
        }
        sol+=v[curr].val;
        Que[1][++dr[1]]=curr;
    }

    dfs(curr,0,0);
    printf("%lld\n",sol);

    for(int i=1;i<=n;i++)
        cout<<len[i]<<" "<<codes[i]<<"\n";

    return 0;
}