Given a set of n numbers , you are asked to perform q queries. Each query is one of the two types:

Type 1: Determine whether there exists a subset of numbers that sum up to s.

Type 2: Remove the given number s from the set.

Input

The first line of the input contains a single integer n (1 β€ n β€ 300), the size of the set of numbers. The second line contains n space-separated integers , the elements of the set.

The third line of the input contains a single integer q , the number of queries. The next q lines each contain two space-separated integers, t, and s :

For a Type 1 query, the first integer t is 1 and the second integer s represents the target sum.

For a Type 2 query, the first integer t is 2 and the second integer s represents the element that should be removed.

The number of Type 2 queries does not exceed 200

Output

For each Type 1 query, output Yes if such a subset exists, otherwise output No.