Given a sorted integer sequence in the ascending order and some queries, determine whether each queried number is in the sequence or not.
There are multiple test cases. Each case begins with an integer N (1 <= N <= 106) in a line. The second line contains N integers, separated by a space. The third line contains an integer Q (1 <= Q <= 106) representing the number of the queries. In the next Q lines, each line contains an integer, representing a query. The input is terminated if N = 0.
For each query, print “Yes” (without quotes) if the queried integer is in the given sequence and print “No” (without quotes) otherwise. Print a blank line between every two test cases.