#include <fstream>
#define oo 2000000000
#include <list>

using namespace std;
ifstream fin ("interclasari.in");
ofstream fout ("interclasari.out");

list<int> L[21];
int minim, n, i, pminim, m, x, j, sum;

int main () {

    fin>>n;
    for (i=1;i<=n;i++) {
        fin>>m;
        sum += m;
        for (j=1;j<=m;j++) {
            fin>>x;
            L[i].push_back(x);
        }
    }
    fout<<sum<<"\n";

    for (;;) {
        minim = oo;
        for (i=1;i<=n;i++)
            if (!L[i].empty()) {
                x = L[i].front();
                if (x < minim) {
                    minim = x;
                    pminim = i;
                }
            }
        if (minim == oo)
            break;

        fout<<minim<<" ";
        L[pminim].pop_front();
    }

    return 0;
}