//proverka na spelling ASP

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;



class MapEntry<K extends Comparable<K>,E> implements Comparable<K> {
    K key;
    E value;

    public MapEntry (K key, E val) {
        this.key = key;
        this.value = val;
    }
    public int compareTo (K that) {
        @SuppressWarnings("unchecked")
        MapEntry<K,E> other = (MapEntry<K,E>) that;
        return this.key.compareTo(other.key);
    }
    public String toString () {
        return "(" + key + "," + value + ")";
    }
}


class OBHT<K extends Comparable<K>,E> {

    private MapEntry<K,E>[] buckets;
    static final int NONE = -1; // ... distinct from any bucket index.
    @SuppressWarnings({ "rawtypes", "unchecked" })
    private static final MapEntry former = new MapEntry(null, null);
    private int occupancy = 0;

    @SuppressWarnings("unchecked")
    public OBHT (int m) {
        buckets = (MapEntry<K,E>[]) new MapEntry[m];
    }

    private int hash (K key) {
        return Math.abs(key.hashCode()) % buckets.length;
    }

    public MapEntry<K,E> getBucket(int i) {
        return buckets[i];
    }

    public int search (K targetKey) {
        int b = hash(targetKey);
        int n_search=0;
        for (;;) {
            MapEntry<K,E> oldEntry = buckets[b];
            if (oldEntry == null)
                return NONE;
            else if (targetKey.equals(oldEntry.key))
                return b;
            else {
                b = (b + 1) % buckets.length;
                n_search++;
                if(n_search==buckets.length)
                    return NONE;
            }
        }
    }

    public void insert (K key, E val) {
        MapEntry<K,E> newEntry = new MapEntry<K,E>(key, val);
        int b = hash(key);
        int n_search=0;

        for (;;) {
            MapEntry<K,E> oldEntry = buckets[b];
            if (oldEntry == null) {
                if (++occupancy == buckets.length) {
                    System.out.println("Hash tabelata e polna!!!");
                }
                buckets[b] = newEntry;
                return;
            } else if (oldEntry == former
                       || key.equals(oldEntry.key)) {
                buckets[b] = newEntry;
                return;
            } else {
                b = (b + 1) % buckets.length;
                n_search++;
                if(n_search==buckets.length)
                    return;

            }
        }
    }

    @SuppressWarnings("unchecked")
    public void delete (K key) {
        int b = hash(key);
        int n_search=0;
        for (;;) {
            MapEntry<K,E> oldEntry = buckets[b];

            if (oldEntry == null)
                return;
            else if (key.equals(oldEntry.key)) {
                buckets[b] = former;
                return;
            } else {
                b = (b + 1) % buckets.length;
                n_search++;
                if(n_search==buckets.length)
                    return;

            }
        }
    }

    public String toString () {
        String temp = "";
        for (int i = 0; i < buckets.length; i++) {
            temp += i + ":";
            if (buckets[i] == null)
                temp += "\n";
            else if (buckets[i] == former)
                temp += "former\n";
            else
                temp += buckets[i] + "\n";
        }
        return temp;
    }
}


class Zbor implements Comparable<Zbor> {
    String zbor;

    public Zbor(String zbor) {
        this.zbor = zbor;
    }
    @Override
    public boolean equals(Object obj) {
        Zbor pom = (Zbor) obj;
        return this.zbor.equals(pom.zbor);
    }
    @Override
    public int hashCode() {
        char ch[];
        ch = zbor.toCharArray();
        int xlength = zbor.length();

        int i, sum;
        for (sum=0, i=0; i < zbor.length(); i++)
            sum += ch[i];
        return sum % 31;
    }
    @Override
    public String toString() {
        return zbor;
    }
    @Override
    public int compareTo(Zbor arg0) {
        return zbor.compareTo(arg0.zbor);
    }
}

public class Speluvanje {
    //isPunct funkcija
    public static  boolean isPunct(String zbor) {
        int length = zbor.length();
        char c = zbor.charAt(length-1);
        return (c == '!' || c==',' || c == '?'|| c =='.');
    }

    public static void main(String[] args) throws IOException {



        OBHT<Zbor, String> tabela;
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int N = Integer.parseInt(br.readLine());
        //---Vie odluchete za goleminata na hesh tabelata----
        tabela = new OBHT<Zbor,String>(401);

        //procitaj gi zborovite
        //dodaj gi site elementi vo hashot
        for(int i = 0 ; i <N; i++) {
            String text =  br.readLine();
            Zbor zbor = new Zbor(text);
            tabela.insert(zbor, text);
        }
        //vcitaj go tekstot
        String tekst = br.readLine();

        String[] strings = tekst.split(" ");

        boolean isTochno = true;
        int br_netochni = 0;
        //podeli go tekstot na zborovi i iteriraj niz site niv
        if(tekst.length()==1) {
            if(isPunct(tekst)) {
                System.out.println("Bravo");
            }
        }
        for(int i =0; i<strings.length; i++) {
            //proveri dali zavrshuva so interpunciski znak
            if(isPunct(strings[i])) {
                strings[i] = strings[i].substring(0,strings[i].length()-1);
            }

            if(strings[i].isEmpty()) {
                isTochno = true;
            }


            Zbor zbor = new Zbor(strings[i].toLowerCase());
            int key = tabela.search(zbor);

            //proveri dali elementot postoi vo hashot so search
            if(key!=-1) {

                if(zbor.toString().equals(tabela.getBucket(key).value)) {
                    isTochno=true;

                } else {
                    isTochno = false;
                    br_netochni++;
                }


            } else {
                br_netochni++;
                isTochno = false;
                System.out.println(strings[i]);
            }


        }
        if(isTochno==true) {
            if(br_netochni==0) {
                System.out.println("Bravo");
            }
        }

        /*
        *
        * Vashiot kod tuka....
        *
        */
    }
}