/*
 * GCA : "Computer is artificial subject absolutely,Math is God"
 */
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#else
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...)
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long int UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Pln() printf("\n")
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define M 105
#define PB push_back
#define oo INT_MAX
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-9
#define X first
#define Y second
inline bool xdy(double x,double y){return x>y+eps;}
inline bool xddy(double x,double y){return x>y-eps;}
inline bool xcy(double x,double y){return x<y-eps;}
inline bool xcdy(double x,double y){return x<y+eps;}
const Int mod=1000000007;
map<string,int> isgroup;
set<string> s;
int n;
vector<string> g[M];
bool vis[M];
void dfs(int index){
	vis[index]=1;
	FOR(it,g[index]){
		if(isgroup.count(*it)){
			int j=isgroup[*it];
			if(!vis[j])dfs(j);
		}else s.insert(*it);
	}
}
int main() {
	ios_base::sync_with_stdio(0);
	while(~scanf("%d%*c",&n)&&n){
		s.clear();
		Set(vis,0);
		isgroup.clear();
		for(int i=1;i<=n;i++)g[i].clear();
		for(int i=1;i<=n;i++){
			char str[105];
			scanf("%[^:]%*c",str);
			isgroup[str]=i;
			char c=',';
			while(c!='.'){
				scanf("%[^,.]%c",str,&c);
				g[i].PB(str);
			}
			getchar();
		}
		dfs(1);
		printf("%d\n",s.size());
	}

















}