#include <fstream>
#include <algorithm>

using namespace std;
ifstream f ("interclasari.in");
ofstream g ("interclasari.out");
int v[20000001],n,i,j,st,x;
int main()
{f>>n;
    for(i=1;i<=n;i++){
                f>>x;
                    for(j=1;j<=x;j++)
                        f>>v[st+j];

                            st=st+x;}
        sort(v+1,v+st+1);
        g<<st<<'\n';
            for(i=1;i<=st;i++)
                g<<v[i]<<" ";

    return 0;
}