#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>

using namespace std;

set<string> S[100];
map<string, int> mp;
vector< vector<string> > vs;

int search(int cur){
	for(int i=0;i<vs[cur].size();i++){
		if(mp.count(vs[cur][i])){
			int next = mp[vs[cur][i]];
			if(S[next].empty()) search(next);
			for(set<string>::iterator it=S[next].begin();it!=S[next].end();it++)
				S[cur].insert(*it);
		}
		else{
			S[cur].insert(vs[cur][i]);
		}
	}
	return S[cur].size();
}

int main(){
	int n;
	ifstream fin("A.in");
	while(fin >> n, n){
		mp.clear();
		vs.assign(n, vector<string>());
		for(int i=0;i<n;i++){
			S[i].clear();
			string str; fin >> str;
			for(int j=0;j<str.size();j++)
				if(!islower(str[j])) str[j] = ' ';
			istringstream iss(str);
			iss >> str; mp[str] = i;
			while(iss >> str) vs[i].push_back(str);
		}
		cout << search(0) << endl;
	}
}