#include <fstream>
#include <queue>

std::ifstream f("huffman.in");
std::ofstream g("huffman.out");

struct Node { long long val; int leftPos, rightPos;};

Node nodes[2000001];
long long unsigned len[1000001];
long long unsigned code[1000001];

int getNodePosWithMinValue(Node nodes[], std::queue<int>& initial, std::queue<int>& internal)
{
    int pos = -1;
    if(initial.empty())
    {
        pos = internal.front();
        internal.pop();
    }
    else if(internal.empty())
    {
        pos = initial.front();
        initial.pop();
    }
    else
    {
        int initialFront = initial.front();
        int internalFront = internal.front();
        if(nodes[initialFront].val < nodes[internalFront].val)
        {
            pos = initialFront;
            initial.pop();
        }
        else
        {
            pos = internalFront;
            internal.pop();
        }
    }

    return pos;
}

int Huffman(Node nodes[], int n, std::queue<int> initial)
{
    std::queue<int> internal;

    while( ( initial.size() + internal.size() ) > 1)
    {

        int leftPos = getNodePosWithMinValue(nodes, initial, internal);
        int rightPos = getNodePosWithMinValue(nodes, initial, internal);

        nodes[++n].val = nodes[leftPos].val + nodes[rightPos].val;
        nodes[n].leftPos = leftPos;
        nodes[n].rightPos = rightPos;

        internal.push(n);
    }

    return internal.front();
}

void DepthFirst(Node nodes[], int pos, long long int val = 0, int length = 0)
{
    if (nodes[pos].leftPos != -1)
    {
        DepthFirst(nodes, nodes[pos].leftPos, val * 2, length + 1);
    }

    if (nodes[pos].rightPos != -1)
    {
        DepthFirst(nodes, nodes[pos].rightPos, val * 2 + 1, length + 1);
    }

    if (nodes[pos].rightPos == -1 && nodes[pos].leftPos == -1)
    {
        len[pos] = length;
        code[pos] = val;
    }
}

int main()
{
    std::ios::sync_with_stdio(false);

    int n;
    f >> n;

    std::queue<int> initial;

    for(auto i = 0; i < n; ++i)
    {
        f >> nodes[i].val;
        nodes[i].leftPos = -1;
        nodes[i].rightPos = -1;

        initial.push(i);
    }

    int root = Huffman(nodes, n, initial);
    DepthFirst(nodes, root);

    long long unsigned lg = 0;
    for (auto i = 0; i < n; ++i)
    {
        lg += len[i] * nodes[i].val;
    }

    g << lg << '\n';

    for (auto i = 0; i < n; ++i)
    {
        g << len[i] << ' ' << code[i] << '\n';
    }

    f.close();
    g.close();

    return 0;
}