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 + ")";
	}

	public E getValue() {
		return 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() {
		final int prime = 31;
		int result = 1;
		result = prime * result + ((zbor == null) ? 0 : zbor.hashCode());
		return result;
	}

	@Override
	public String toString() {
		return zbor;
	}

	@Override
	public int compareTo(Zbor arg0) {
		return zbor.compareTo(arg0.zbor);
	}
}


public class Preveduvac {
	public static void main (String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int N = Integer.parseInt(br.readLine());

		OBHT<String,String> table1 = new OBHT<String,String>(N);

		for(int i=1;i<=N;i++){
			String zborce = br.readLine();
			String[] pom = zborce.split(" ");
			table1.insert(pom[0], pom[1]);

		}

		String zborce1=br.readLine();
		String pom1;
		do{

		for(int i=0; i<N;i++)
		{
			if (table1.getBucket(i).value.equals(zborce1)) {
				pom1 = table1.getBucket(i).key;
				System.out.println(pom1);
				break;
		     }

            else{
                pom1=new Zbor("/");

            }

		}

			zborce1 = br.readLine();

		}while(!zborce1.equalsIgnoreCase("KRAJ"));


	}
}