write a go solution for Description:
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.

Input Format:
The first line contains one integer m (1<=m<=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<=v_i<=29). If t_i=2, then the i-th query is GET v_i (0<=v_i<=10^9).

Output Format:
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.

Note:
None. Output only the code with no comments, explanation, or additional text.