#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define translow transform(s.begin(),s.end(),s.begin(),::tolower);
#define transup transform(s.begin(),s.end(),s.begin(),::toupper);
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
ll mod=1e9+7;
vector<ll>adj[100000];
vector<ll>ans,parent;
map<string,ll>id;
map<ll,string>id2;
bool visited[100000];
                    
        

            void dfs(ll source)
            {
                visited[source]=true;
                for(auto it:adj[source])
                {
                    if(visited[it]==false)
                        dfs(it);
                }

                ans.pb(source);
            }



int main() {
				fast
                #ifndef ONLINE_JUDGE
                freopen("input.txt","r",stdin);
                freopen("output.txt","w",stdout);
                #endif
                
                ll n,xx=1;
                while(cin>>n)
                {
                    memset(visited,false,sizeof(visited));
                  
                    for(ll i=0;i<n;i++)
                    {
                        string s;
                        cin>>s;
                        id[s]=i+1;
                        id2[i+1]=s;
                    }
                    ll m;
                    cin>>m;
                    for(ll i=0;i<m;i++)
                    {
                        string a,b;
                        cin>>a>>b;
                        adj[id[b]].pb(id[a]); //directed reverse graph
                        //add(id[a],id[b]);
                    }

                    for(ll i=1;i<=n;i++)
                    {
                        if(visited[i]==false)
                        {
                            dfs(i);
                        }
                    }
                   
 cout<<"Case #"<<xx<<": Vivek should drink beverages in this order: ";

                    for(ll i=0;i<ans.size()-1;i++)
                       cout<<id2[ans[i]]<<" ";
                   cout<<id2[ans[ans.size()-1]]<<"."<<endl;
                   xx+=1;
                   ans.clear();
                }


                return 0;
            }