// Arup Guha
// 4/2/2017
// Solution to 1991 UCF HS Contest Problem: Vandalism

import java.util.*;

public class vandals {

	public static void main(String[] args) {

		Scanner stdin = new Scanner(System.in);

		// Read in original.
		int n = Integer.parseInt(stdin.nextLine().trim());
		String msg = stdin.nextLine();
		for (int i=0; i<n-1; i++) msg = msg + stdin.nextLine();

		// Read in vandalized message.
		n = Integer.parseInt(stdin.nextLine().trim());
		String after = stdin.nextLine();
		for (int i=0; i<n-1; i++) after = after + stdin.nextLine();

		// Get letter frequencies, subtract to get what was stolen.
		int[] f1 = freq(msg);
		int[] f2 = freq(after);
		int[] stole = sub(f1, f2);

		// Read names till EOF.
		while (stdin.hasNext()) {

			// Get letter frequencies in name and then solve.
			String name = stdin.nextLine();
			int[] letters = freq(name);

			// Output result.
			if (contains(stole, letters))
				System.out.println(name+" is still a suspect");
			else
				System.out.println(name+" is no longer a suspect");
		}
	}

	public static int[] freq(String s) {

		// Count up letter frequencies.
		int[] res = new int[26];
		for (int i=0; i<s.length(); i++) {
			if (Character.isLetter(s.charAt(i)))
				res[s.charAt(i)-'A']++;
		}

		return res;
	}

	public static int[] sub(int[] f1, int[] f2) {

		// Subtract store and return.
		int[] res = new int[f1.length];
		for (int i=0; i<f1.length; i++)
			res[i] = f1[i] - f2[i];
		return res;
	}

	public static boolean contains(int[] f1, int[] f2) {

		// f1 isn't contained in f2 if any letter appears more times.
		for (int i=0; i<f1.length; i++)
			if (f1[i] > f2[i])
				return false;

		// If we get here, we're good.
		return true;
	}
}