CF1221A.2048 Game

You are playing a variation of game 2048. Initially you have a multiset $s$ of $n$ integers. Every integer in this multiset is a power of two.

You may perform any number (possibly, zero) operations with this multiset.

During each operation you choose two equal integers from $s$, remove them from $s$ and insert the number equal to their sum into $s$.

For example, if $s = {1, 2, 1, 1, 4, 2, 2}$ and you choose integers $2$ and $2$, then the multiset becomes ${1, 1, 1, 4, 4, 2}$.

You win if the number $2048$ belongs to your multiset. For example, if $s = {1024, 512, 512, 4}$ you can win as follows: choose $512$ and $512$, your multiset turns into ${1024, 1024, 4}$. Then choose $1024$ and $1024$, your multiset turns into ${2048, 4}$ and you win.

You have to determine if you can win this game.

You have to answer $q$ independent queries.

你正在玩一个 2048 游戏的变种。初始时，你有一个包含 $n$ 个整数的多重集 $s$。该多重集中每个整数均为 $2$ 的幂。

你可以对该多重集执行任意次数（可能为零次）的操作。

每次操作中，你从 $s$ 中选出两个相等的整数，将它们从 $s$ 中移除，并向 $s$ 中插入一个等于它们之和的数。

例如，若 $s = \{1, 2, 1, 1, 4, 2, 2\}$，且你选择两个 $2$，则多重集变为 $\{1, 1, 1, 4, 4, 2\}$。

当多重集 $s$ 中包含数字 $2048$ 时，你获胜。例如，若 $s = \{1024, 512, 512, 4\}$，你可以按如下方式获胜：先选择两个 $512$，多重集变为 $\{1024, 1024, 4\}$；再选择两个 $1024$，多重集变为 $\{2048, 4\}$，从而获胜。

你需要判断是否能够赢得该游戏。

你需要回答 $q$ 个相互独立的查询。

The first line contains one integer $q$ ($1 \le q \le 100$) – the number of queries.

The first line of each query contains one integer $n$ ($1 \le n \le 100$) — the number of elements in multiset.

The second line of each query contains $n$ integers $s_1, s_2, \dots, s_n$ ($1 \le s_i \le 2^{29}$) — the description of the multiset. It is guaranteed that all elements of the multiset are powers of two.

第一行包含一个整数 $q$（$1 \le q \le 100$）—— 查询次数。

每个查询的第一行包含一个整数 $n$（$1 \le n \le 100$）—— 多重集中的元素个数。

每个查询的第二行包含 $n$ 个整数 $s_1, s_2, \dots, s_n$（$1 \le s_i \le 2^{29}$）—— 多重集的描述。保证多重集中的所有元素均为 $2$ 的幂。

For each query print YES if it is possible to obtain the number $2048$ in your multiset, and NO otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).

对于每个查询，如果可以在你的多重集中得到数字 $2048$，则输出 YES；否则输出 NO。

你可以以任意大小写形式输出每个字母（例如，字符串 yEs、yes、Yes 和 YES 均被视为肯定回答）。

In the first query you can win as follows: choose $512$ and $512$, and $s$ turns into ${1024, 64, 1024}$. Then choose $1024$ and $1024$, and $s$ turns into ${2048, 64}$ and you win.

In the second query $s$ contains $2048$ initially.

在第一次查询中，你可以按如下方式获胜：选择 $512$ 和 $512$，此时 $s$ 变为 ${1024, 64, 1024}$；然后选择 $1024$ 和 $1024$，此时 $s$ 变为 ${2048, 64}$，你获胜。

在第二次查询中，$s$ 初始即包含 $2048$。