#include<bits/stdc++.h>
using namespace std;
 
#define debug(x) cerr << #x << ": " << (x) << endl
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define dwn(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define all(x) (x).begin(), (x).end()
 
#define x first
#define y second
using pii = pair<int, int>;
using ll = long long;
 
inline void read(int &x){
    int s=0; x=1;
    char ch=getchar();
    while(ch<'0' || ch>'9') {if(ch=='-')x=-1;ch=getchar();}
    while(ch>='0' && ch<='9') s=(s<<3)+(s<<1)+ch-'0',ch=getchar();
    x*=s;
}

map<string, set<string>> res;
vector<string> d;

string work(string &s){
	string res;
	for(auto e: s) if(isalpha(e)) res+=tolower(e);
	return res;
}

bool ok(string a, string b){
	if(a==b) return false;
	if(a.size()>b.size()) swap(a, b);
	if(a.size()==b.size()){
		int cnt=0;
		rep(i, 0, (int)a.size()-1) if(a[i]!=b[i]) cnt++;
		if(cnt==1) return true;
		if(cnt==2){
			rep(i, 0, (int)a.size()-2){
				if(a[i]==b[i+1] && a[i+1]==b[i]) return true;
			}
		}
	}
	else if(a.size()+1==b.size()){
		bool fl=true;
		int idx=0;
		rep(i, 0, (int)b.size()-1){
			if(a[idx]!=b[i]){
				if(!fl) return false;
				fl=false;
			}
			else{
				idx++;
			}
		}
		return true;
	}
	
	return false;
}

signed main(){
	string s;
	while(getline(cin, s)){
		if(s=="***") break;
		stringstream ssin(s);
		string tmp;
		while(ssin>>tmp){
			tmp=work(tmp);
			if(tmp=="") continue;
			
			for(auto &t: d){
				if(ok(t, tmp)){
					res[t].insert(tmp);
					res[tmp].insert(t);
				}
			}
			
			d.pb(tmp);
		}
	}
	// debug(ok("close", "lose"));
	// for(auto &e: d) debug(e);
	
	bool fl=false;
	for(auto &[x, y]: res){
		fl=true;
		cout<<x<<": ";
		for(auto e: y) cout<<e<<" ";
		puts("");
	}
	if(!fl) puts("***");
	
	return 0;
}