#include <bits/stdc++.h>

using namespace std;
ifstream fin("huffman.in");
ofstream fout("huffman.out");
typedef long long ll;

ll n, l, total;
ll nums[2000005];
pair<int, int> sons[1000005];
pair<int, ll> sol[1000005];
queue<int> que, inside;

void dfs(int now, ll code, int add);
ll getmin();

int main()
{

    fin >> n;
    l = n;

    for(ll i = 1; i <= n; ++i){
        fin >> nums[i];
        que.push(i);
    }

    for(ll i = 1; i < n; ++i){
        ll m1 = getmin(), m2 = getmin();

        total += (nums[m1] + nums[m2]);
        ++l;
        sons[l - n] = {m1, m2};
        nums[l] = {nums[m1] + nums[m2]};
        inside.push(l);
    }

    dfs(l, 0, 0);

    fout << total << "\n";

    for(ll i = 1; i <= n; ++i){
        fout << sol[i].first << " " << sol[i].second << "\n";
    }

    return 0;
}

ll getmin(){
    ll ret;

    if(inside.empty()) {
        ret = que.front();
        que.pop();
    }
    else if(que.empty()) {
        ret = inside.front();
        inside.pop();
    }
    else{
        if(nums[que.front()] <= nums[inside.front()]){
            ret = que.front();
            que.pop();
        }
        else{
            ret = inside.front();
            inside.pop();
        }
    }

    return ret;
}

void dfs(int now, ll code, int add){
    if(now <= n){
        sol[now] = {add, code};
        return;
    }

    dfs(sons[now - n].first, code * 2, add + 1);
    dfs(sons[now - n].second, code * 2 + 1, add + 1);
}