CF1913C.Game with Multiset

In this problem, you are initially given an empty multiset. You have to process two types of queries:

1. ADD $x$ — add an element equal to $2^{x}$ to the multiset;
2. GET $w$ — say whether it is possible to take the sum of some subset of the current multiset and get a value equal to $w$.

本题中，你初始时会得到一个空的多重集。你需要处理两种类型的查询：

1. ADD $x$ — 向多重集中添加一个值为 $2^{x}$ 的元素；
2. GET $w$ — 判断当前多重集中是否存在某个子集，其元素之和恰好等于 $w$。

The first line contains one integer $m$ ($1 \le m \le 10^5$) — the number of queries.

Then $m$ lines follow, each of which contains two integers $t_i$, $v_i$, denoting the $i$-th query. If $t_i = 1$, then the $i$-th query is ADD $v_i$ ($0 \le v_i \le 29$). If $t_i = 2$, then the $i$-th query is GET $v_i$ ($0 \le v_i \le 10^9$).

第一行包含一个整数 $m$（$1 \le m \le 10^5$）—— 表示查询次数。

接下来是 $m$ 行，每行包含两个整数 $t_i$ 和 $v_i$，表示第 $i$ 个查询。若 $t_i = 1$，则第 $i$ 个查询为 ADD $v_i$（$0 \le v_i \le 29$）；若 $t_i = 2$，则第 $i$ 个查询为 GET $v_i$（$0 \le v_i \le 10^9$）。

For each GET query, print YES if it is possible to choose a subset with sum equal to $w$, or NO if it is impossible.

对于每个 GET 查询，如果能够选择一个子集使其元素和等于 $w$，则输出 YES；否则输出 NO。