#include <bits/stdc++.h>

using namespace std;

ifstream fin( "huffman.in" );
ofstream fout( "huffman.out" );

const int NMAX = 1000005;

int n;
int frec[NMAX];
priority_queue < pair<int, int> > H;
int lf[2 * NMAX], rg[2 * NMAX];
vector <string> codes(NMAX);
string current;

long long Str_to_Int( string s ) {
    long long ans = 0;
    long long _aux = 1;

    for( int i = s.size() - 1; i >= 0; --i ) {
        ans += ( s[i] == '1' ) * _aux;
        _aux = ( _aux << 1 );
    }
    return ans;
}

void Dfs( int nod ) {
    if( lf[nod] == 0 && rg[nod] == 0 ) {
        codes[nod] = current;
        return;
    }

    current.push_back( '0' );
    Dfs( lf[nod] );
    current.pop_back();

    current.push_back( '1' );
    Dfs( rg[nod] );
    current.pop_back();
}

int main()
{
    fin >> n;

    for( int i = 1; i <= n; ++i ) {
        fin >> frec[i];
        H.push( { -frec[i], i } );
    }

    int nr_nodes = n;
    while( H.size() > 1 ) {
        int nod1, c1, nod2, c2;

        nod1 = H.top().second;
        c1 = H.top().first;
        H.pop();

        nod2 = H.top().second;
        c2 = H.top().first;
        H.pop();

        ++nr_nodes;
        lf[nr_nodes] = nod1;
        rg[nr_nodes] = nod2;

        H.push( { c1 + c2, nr_nodes } );
    }

    //for( int i = 1; i <= nr_nodes; ++i )
    //    fout << i << ' ' << lf[i] << '\n' << i << ' ' << rg[i] << '\n';

    int root = H.top().second;

    Dfs( root );

    long long lg = 0;
    for( int i = 1; i <= n; ++i )
        lg += 1LL * frec[i] * codes[i].size();

    fout << lg << '\n';
    for( int i = 1; i <= n; ++i )
        fout << codes[i].size() << ' ' << Str_to_Int( codes[i] ) << '\n';

    fin.close();
    fout.close();

    return 0;
}