#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

int main()
{
    for(int n; cin >> n && n; )
	{
		vector<vint> time(32);
		vector<pair<int, string> > scores(n, mp(0, ""));
		
		rep(i, n)
		{
			int times;
			cin >> scores[i].second >> times;
			
			rep(j, times)
			{
				int t;
				cin >> t;
				time[t].push_back(i);
			}
		}
		
		rep(i, 30)
		{
			int p = n - time[i].size() + 1;
			rep(j, time[i].size()) scores[time[i][j]].first += p;
		}
		
		sort(ALL(scores));
		cout << scores[0].first << " " << scores[0].second << endl;
	}
}