#include <fstream>
#include<list>
using namespace std;

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

int main() {
    ifstream fin("interclasari.in");
    ofstream fout("interclasari.out");
    fin>>n;
    for (i=1;i<=n;i++) {
        fin>>k;
        if (k > 0)
            foto+=k;
        for (j=1;j<=k;j++) {
            fin>>x;
            L[i].push_back(x);
        }
    }
    fout<<foto<<"\n";

    for (;;) {
        minim = 2000000000;
        for (i=1;i<=n;i++)
            if (L[i].size()) {
                if (minim > L[i].front()) {
                    minim = L[i].front();
                    pminim = i;
                }
            }
        if (minim == 2000000000)
            break;
        fout<<minim<<" ";
        L[pminim].pop_front();

    }

    return 0;
}