#include <fstream>
#include <vector>
#include <set>

using namespace std;

#define int long long

struct node
{
    int st, dr, sum;
};

ifstream in("huffman.in");
ofstream out("huffman.out");
int n, cnt, ans;
int st1, dr1;
int st2, dr2;
node v[2000005];
pair<int, int> frunze[2000005];
pair<int, int> interne[2000005];
pair<int, int> rez[1000005];
int INF = (1LL << 60);

void adauga(pair<int, int> a, pair<int, int> b)
{
    cnt++;
    v[cnt].st = a.second;
    v[cnt].dr = b.second;
    v[cnt].sum = a.first + b.first;

    dr2++;
    interne[dr2] = {v[cnt].sum, cnt};
}

void dfs(int node, int cod, int len)
{
    if(v[node].st == 0)
    {
        rez[node] = {len, cod};

        return;
    }

    ans += v[node].sum;

    dfs(v[node].st, 2 * cod, len + 1);
    dfs(v[node].dr, 2 * cod + 1, len + 1);
}

signed main()
{
    in>>n;

    for(int i = 1; i<=2*n; i++)
    {
        frunze[i] = interne[i] = {INF, INF};
        //ca sa nu am treaba cu st sa treaca peste dr
        //(nu trece ca o sa fie costul mai mare si prefera mereu cealalta varianta)
    }

    int x;
    for(int i = 1; i<=n; i++)
    {
        in>>x;

        dr1++;
        frunze[dr1] = {x, i};
    }

    st1 = st2 = 1;

    cnt = n;
    for(int i = 1; i<n; i++)
    {
        int best = min(min(frunze[st1].first + frunze[st1 + 1].first, frunze[st1].first + interne[st2].first), interne[st2].first + interne[st2 + 1].first);

        //out<<best<<'\n';

        if(frunze[st1].first + frunze[st1 + 1].first == best)
        {
            adauga(frunze[st1], frunze[st1 + 1]);

            st1 += 2;
        }
        else if(frunze[st1].first + interne[st2].first == best)
        {
            adauga(frunze[st1], interne[st2]);

            st1++;
            st2++;
        }
        else
        {
            adauga(interne[st2], interne[st2 + 1]);

            st2 += 2;
        }
    }

    dfs(cnt, 0, 0);

    out<<ans<<'\n';
    for(int i = 1; i<=n; i++)
    {
        out<<rez[i].first<<" "<<rez[i].second<<'\n';
    }

    return 0;
}