// Arup Guha
// 10/9/2015
// Solution to 2001 UCF HS Contest Problem: All Your Base are Belong to Us!

import java.util.*;

public class base {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);
		int n = stdin.nextInt();

		// Process each case.
		while (n >= 0) {

			// Add all pairs.
			TreeSet<pair> myPairs = new TreeSet<pair>();
			for (int i=0; i<n; i++) {
				int x = stdin.nextInt();
				int y = stdin.nextInt();
				myPairs.add(new pair(x,y));
			}

			int numBomb = stdin.nextInt();

			// Get each bombed pair, and remove it, if it exists in the tree set.
			for (int i=0; i<numBomb; i++) {
				int x = stdin.nextInt();
				int y = stdin.nextInt();
				pair tmp = new pair(x,y);
				if (myPairs.contains(tmp))
					myPairs.remove(tmp);
			}

			// Everything bombed!
			if (myPairs.size() == 0) {
				System.out.println("All your base are belong to us!");
			}

			// Print what's left.
			else {
				while (myPairs.size() > 0) {
					pair next = myPairs.pollFirst();
					System.out.println("We missed the base at "+next);
				}
			}

			// After cases.
			System.out.println();


			// Get next case.
			n = stdin.nextInt();
		}
	}
}

class pair implements Comparable<pair> {

	public int x;
	public int y;

	public pair(int myx, int myy) {
		x = myx;
		y = myy;
	}

	public int compareTo(pair other) {
		if (this.y != other.y) return this.y - other.y;
		return this.x - other.x;
	}

	public String toString() {
		return "(" + x + ", " + y +")";
	}
}