#include<bits/stdc++.h>
#include <stdlib.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define f0(i,n) for(int i=0;i<=n;i++)
#define first_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define in_buffer cin.ignore(numeric_limits<streamsize>::max(), '\n')
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long
#define zero (int)0
#define int long long
#define double long double
#define pb push_back
#define pii make_pair
#define goto_hell return 0
#define newline cout  << "\n"
#define endl "\n" // << flush
#define all(x) x.begin(),x.end()
#define sz(x) x.size()
using namespace __gnu_pbds;
using namespace std;
const int mod = 1e9+7;
const int inf = LONG_MAX;


void solve(int test)
{
    int n;
    cin >> n;
    map<int,vector<string>>sap;
    for(int i=0;i<n;i++)
    {
        int d;
        string s;
        cin >> d;
        vector<string>v;
        for(int j=0;j<d;j++)
        {
            cin >> s;
            v.pb(s);
        }
        sap[d]=v;
    }
    cout << sap.rbegin()->first << endl;
    vector<string>v = sap.rbegin()->second;
    for(auto it : v)
    {
        cout << it << endl;
    }

}



int32_t main()
{
    first_IO;
    int test=1;
    //cin >> test;
    //cout << "Test = " << test << endl;
    //in_buffer;
    for(int t=1;t<=test;t++)solve(t);
    goto_hell;
}