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

class MapEntry<K extends Comparable<K>, E> implements Comparable<K> {

    // Each MapEntry object is a pair consisting of a key (a Comparable
    // object) and a value (an arbitrary object).
    K key;
    E value;

    public MapEntry(K key, E val) {
        this.key = key;
        this.value = val;
    }

    public int compareTo(K that) {
        // Compare this map entry to that map entry.
        @SuppressWarnings("unchecked")
        MapEntry<K, E> other = (MapEntry<K, E>) that;
        return this.key.compareTo(other.key);
    }

    public String toString() {
        return "<" + key + "," + value + ">";
    }
}

class SLLNode<E> {

    protected E element;
    protected SLLNode<E> succ;

    public SLLNode(E elem, SLLNode<E> succ) {
        this.element = elem;
        this.succ = succ;
    }

    @Override
    public String toString() {
        return element.toString();
    }
}

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

    // An object of class CBHT is a closed-bucket hash table, containing
    // entries of class MapEntry.
    private SLLNode<MapEntry<K, E>>[] buckets;

    @SuppressWarnings("unchecked")
    public CBHT(int m) {
        // Construct an empty CBHT with m buckets.
        buckets = (SLLNode<MapEntry<K, E>>[]) new SLLNode[m];
    }

    private int hash(K key) {
        // Napishete ja vie HASH FUNKCIJATA

        return Math.abs(key.hashCode()) % buckets.length;

    }

    public SLLNode<MapEntry<K, E>> search(K targetKey) {
        // Find which if any node of this CBHT contains an entry whose key is
        // equal
        // to targetKey. Return a link to that node (or null if there is none).
        int b = hash(targetKey);
        for (SLLNode<MapEntry<K, E>> curr = buckets[b]; curr != null; curr = curr.succ) {
            if (targetKey.equals(((MapEntry<K, E>) curr.element).key)) {
                return curr;
            }
        }
        return null;
    }

    public void insert(K key, E val) {      // Insert the entry <key, val> into this CBHT.
        MapEntry<K, E> newEntry = new MapEntry<K, E>(key, val);
        int b = hash(key);
        for (SLLNode<MapEntry<K, E>> curr = buckets[b]; curr != null; curr = curr.succ) {
            if (key.equals(((MapEntry<K, E>) curr.element).key)) {
                // Make newEntry replace the existing entry ...
                curr.element = newEntry;
                return;
            }
        }
        // Insert newEntry at the front of the 1WLL in bucket b ...
        buckets[b] = new SLLNode<MapEntry<K, E>>(newEntry, buckets[b]);
    }

    public void delete(K key) {
        // Delete the entry (if any) whose key is equal to key from this CBHT.
        int b = hash(key);
        for (SLLNode<MapEntry<K, E>> pred = null, curr = buckets[b]; curr != null; pred = curr, curr = curr.succ) {
            if (key.equals(((MapEntry<K, E>) curr.element).key)) {
                if (pred == null) {
                    buckets[b] = curr.succ;
                } else {
                    pred.succ = curr.succ;
                }
                return;
            }
        }
    }

    public String toString() {
        String temp = "";
        for (int i = 0; i < buckets.length; i++) {
            temp += i + ":";
            for (SLLNode<MapEntry<K, E>> curr = buckets[i]; curr != null; curr = curr.succ) {
                temp += curr.element.toString() + " ";
            }
            temp += "\n";
        }
        return temp;
    }

}

public class KumanovskiDijalekt {

    public static boolean checkPunct(String s) {
        int lenght = s.length();
        char echar = s.charAt(lenght - 1);
        return echar == '.' || echar == ',' || echar == '!' || echar == '?';
    }

    public static boolean isUpperCase(char ch) {
        return ch >= 'A' && ch <= 'Z';
    }

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

        BufferedReader br = new BufferedReader(new InputStreamReader(
                System.in));
        int N = Integer.parseInt(br.readLine());

        // Chitanje zborovi
        String rechnik[] = new String[N];
        for (int i = 0; i < N; i++) {
            rechnik[i] = br.readLine();
        }
        // Chitanje tekst
        String tekst = br.readLine();

        CBHT<String, String> hashTabela = new CBHT<>(200);
        // Gi stavame vo hesh
        for (int i = 0; i < N; i++) {
            String[] d = rechnik[i].split(" ");
            hashTabela.insert(d[0], d[1]);
        }

        // go razdeluvame tekstot vo niza od stringovi
        String[] nizaTekst = tekst.split(" ");

        String novTekst = "";
        String punct = ""; // promenliva vo koja se cuvaat interpukciski znaci ? . , !

        for (int i = 0; i < nizaTekst.length; i++) {
            String str;
            punct = "";
            if (checkPunct(nizaTekst[i])) { // Ako na krajot ima tocka, izvadi ja i zacuvaj ja vo punct
                int len = nizaTekst[i].length();
                char p = nizaTekst[i].charAt(len - 1);
                punct = "" + p;
                str = nizaTekst[i].substring(0, len - 1);
            } else { // vo sportivno ne praj nisto samo dodaj vo str
                str = nizaTekst[i];
            }
            // prebaruvaj vo hesh za klucot str
            SLLNode<MapEntry<String, String>> x = hashTabela.search(str.toLowerCase());

            if (x != null) { // proveri dali ima najdeno od hesot i e zacuvano vo x
                if (x.element.key.toLowerCase().equals(str.toLowerCase())) { // dali se sovpagja najdenototo od hesot so momentalniot string
                    if (isUpperCase(str.charAt(0))) { // dali prvata bukva e golema na stringot vo recenicata
                        String xfirstupper = x.element.value.substring(0, 1).toUpperCase()
                                + x.element.value.substring(1); // Ako e golema napraj ja i na noviot string golema sto e izvaden od hash'ot
                        novTekst += xfirstupper + punct + " "; // zalepi gi na noviot tekst
                    } else {
                        novTekst += x.element.value + punct + " ";
                    }
                }
            } else { // vo sporitvno koristi go stariot tekst
                novTekst += str + punct + " ";
            }
        }
        System.out.println(novTekst);

        //Vasiot kod tuka
    }
}