#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef long long int ll;

#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define endl "\n"
const double EPS = 1e-7;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
const double PI = acos(-1);
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

//-------------------------------------

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    while (true)
    {
        int n;
        cin >> n;
        if (n == 0)
        {
            return 0;
        }
        vector<string> s(n);
        vector<int> m(n);
        vector<vector<int>> d(n);
        for (int i = 0; i < n; i++)
        {
            cin >> s[i] >> m[i];
            for (int j = 0; j < m[i]; j++)
            {
                int tmp;
                cin >> tmp;
                d[i].push_back(tmp);
            }
        }
        vector<int> p(n, 0);
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m[i]; j++)
            {
                int num = d[i][j];
                int pt = n;
                for (int k = 0; k < n; k++)
                {
                    if (k == i)
                    {
                        continue;
                    }
                    for (int dd : d[k])
                    {
                        if (dd == num)
                        {
                            pt--;
                        }
                    }
                }
                if (pt == 0)
                {
                    pt++;
                }
                p[i] += pt;
            }
        }
        vector<pair<int, string>> ans(n);
        for (int i = 0; i < n; i++)
        {
            ans[i] = make_pair(p[i], s[i]);
        }
        sort(ALL(ans));
        cout << ans[0].first << ' ' << ans[0].second << endl;
    }
}
