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 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> {

	private SLLNode<MapEntry<K,E>>[] buckets;

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

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

	public SLLNode<MapEntry<K,E>> search(K targetKey) {
		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)) {
				curr.element = newEntry;
				return;
			}
		}
		buckets[b] = new SLLNode<MapEntry<K,E>>(newEntry, buckets[b]);
	}

	public void delete(K key) {
		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 DedoMrazPomoshnici {
	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> dobriDeca = new CBHT<String, String>(N + 1);// Vie ja odreduvate goleminata na tabelata

		// vo imeDobriDeca se zachuvuvaat iminjata na dobrite deca
		String[] imeDobriDeca = new String[N];
		// tuka se zachuvuvaat soodvetnite adresi na decata
		String[] poklonDobriDeca = new String[N];
		String pom;
		for (int i = 0; i < N; i++) {
			pom = br.readLine();
			String[] del = pom.split(" ");
			imeDobriDeca[i] = del[0];
			poklonDobriDeca[i] = del[1];
			dobriDeca.insert(del[0], del[1]);
			/*if(del[0].contains("c"))	{
				del[0] = del[0].replace("c", "ch");
				dobriDeca.insert(del[0], del[1]);
			}
			if(del[0].contains("z"))	{
				del[0] = del[0].replace("z", "zh");
				dobriDeca.insert(del[0], del[1]);
			}
			if(del[0].contains("s"))	{
				del[0] = del[0].replace("s", "sh");
				dobriDeca.insert(del[0], del[1]);
			}*/
		}

		//tuka se zapishuva imeto na deteto shto treba da se proveri
		String deteZaProverka = br.readLine();
		if(deteZaProverka.contains("ch"))
			deteZaProverka = deteZaProverka.replace("ch", "c");
		if(deteZaProverka.contains("Ch"))
			deteZaProverka = deteZaProverka.replace("Ch", "C");
		if(deteZaProverka.contains("zh"))
			deteZaProverka = deteZaProverka.replace("zh", "z");
		if(deteZaProverka.contains("Zh"))
			deteZaProverka = deteZaProverka.replace("Zh", "Z");
		if(deteZaProverka.contains("sh"))
			deteZaProverka = deteZaProverka.replace("sh", "s");
		if(deteZaProverka.contains("Sh"))
			deteZaProverka = deteZaProverka.replace("Sh", "S");
		/*
		 *
		 * Vashiot kod ovde
		 *
		 */
		SLLNode<MapEntry<String,String>> node = dobriDeca.search(deteZaProverka);
		if(node == null)
			System.out.println("Nema poklon");
		else	{
			System.out.println(node.element.value);
		}

	}
}