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 E getValue(){
    	return value;
    }
    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 void main (String[] args) throws IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(
				System.in));
		int N = Integer.parseInt(br.readLine());
		CBHT<String,String> t=new CBHT<String,String>(2*N+1);


		String rechnik[]=new String[N];
		for(int i=0;i<N;i++){
			rechnik[i]=br.readLine();
			String []z=rechnik[i].split(" ");
		    String zb1,zb2;
            zb1= z[0].substring(0, 1).toUpperCase() + z[0].substring(1);
            zb2= z[1].substring(0, 1).toUpperCase() + z[1].substring(1);
            t.insert(zb1, zb2);
			t.insert(z[0], z[1]);

		}

		String tekst=br.readLine();
		String []zbor=tekst.split(" ");
		String izmenet="";
        String z;
		int l=zbor.length;
		for (int i=0;i<l;i++)
		{
            if (t.search(zbor[i])==null)
            {
				izmenet+=zbor[i]+" ";
            }
			else
			{

                 if (zbor[i].contains(",") || zbor[i].contains(".")
                    || zbor[i].contains("!") || zbor[i].contains("?"))
                 {

                   z=zbor[i].substring(0, zbor[i].length()-1);

                  SLLNode<MapEntry<String, String>> zbor1 = t.search(z);

	                if (zbor[i].endsWith(",")) {
	                    izmenet += zbor1.element.value + "," + " ";
	                }
	                else  if (zbor[i].endsWith("."))
	                {
	                    izmenet += zbor1.element.value + "." + " ";
	                }

                 }
                 else

                 {

                 SLLNode<MapEntry<String, String>> zbor1 = t.search(zbor[i]);

	                    izmenet += zbor1.element.value + " ";
	              }
			}



			}
		System.out.println(izmenet);
		}

		}