Description

You are given N different integers a₁, a₂, ..., a_N.

You need to execute Q operations. There are two kinds of operations:
    1. Remove x_i from a₁, a₂, ..., a_N if x_i is in a.
    2. Output "Yes" if y_i is in a₁, a₂, ..., a_N, otherwise output "No".

Note: be careful of the efficiency of your strategy. And we suggest you to solve this problem by not using binary search.

Input

The first line contains one integer N (1 ≤ N ≤ 10⁵) – the number of integers you are given.

The second line contains N integers a₁, a₂, ..., a_N (1 ≤ a_i ≤ 10⁹).

The third line contains one integer Q (1 ≤ Q ≤ 10⁵) – the number of operations you need to execute.

Then Q lines follow. The i+3-th line contains one integer type_i (1 ≤ type_i ≤ 2) – the type of operations you need to execute. If type_i = 1 then one integer x_i (1 ≤ x_i ≤ 10⁹) follows, otherwise one integer y_i (1 ≤ y_i ≤ 10⁹) follows.

It's guaranteed that:

• Every x_i must be greater than or equal to the previous x_i.
• Every y_i must be greater than or equal to the previous y_i.
• For the first seven testcases: 1 ≤ N ≤ 1000

Output

For every second operations output whether y_i is in a₁, a₂, ..., a_N or not then.

Sample Input  Download

Sample Output  Download

Tags

Add Tag

Discuss