CF1032E.The Unbearable Lightness of Weights

You have a set of $n$ weights. You know that their masses are $a_1$, $a_2$, ..., $a_n$ grams, but you don't know which of them has which mass. You can't distinguish the weights.

However, your friend does know the mass of each weight. You can ask your friend to give you exactly $k$ weights with the total mass $m$ (both parameters $k$ and $m$ are chosen by you), and your friend will point to any valid subset of weights, if it is possible.

You are allowed to make this query only once. Find the maximum possible number of weights you can reveal after this query.

你有一组 $n$ 个砝码。你知道它们的质量分别为 $a_1$, $a_2$, ..., $a_n$ 克，但你不知道每个砝码对应哪个质量，且这些砝码外观无法区分。

然而，你的朋友知道每个砝码的确切质量。你可以向朋友提出一次查询：指定一个整数 $k$ 和一个整数 $m$，请求朋友为你选出恰好 $k$ 个砝码，使其总质量恰好为 $m$；如果存在满足条件的砝码子集，朋友将任选一个并指出其中的砝码（即告诉你哪些砝码被选中）。

你仅被允许进行一次这样的查询。问：在最优策略下，你最多能确定多少个砝码的质量？

The first line contains a single integer $n$ ($1 \le n \le 100$) — the number of weights.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \le a_i \le 100$) — the masses of the weights.

第一行包含一个整数 $n$（$1 \le n \le 100$）—— 表示砝码的数量。

第二行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$1 \le a_i \le 100$）—— 表示各砝码的质量。

Print the maximum number of weights you can learn the masses for after making a single query.

输出在进行一次查询后，你能确定质量的最大砝码数量。

In the first example we can ask for a subset of two weights with total mass being equal to $4$, and the only option is to get ${2, 2}$.

Another way to obtain the same result is to ask for a subset of two weights with the total mass of $5$ and get ${1, 4}$. It is easy to see that the two remaining weights have mass of $2$ grams each.

In the second example we can ask for a subset of two weights with total mass being $8$, and the only answer is ${4, 4}$. We can prove it is not possible to learn masses for three weights in one query, but we won't put the proof here.

在第一个例子中，我们可以查询一个总质量为 $4$ 的两个砝码的子集，唯一可能的结果是得到 $\{2, 2\}$。

另一种获得相同结果的方式是查询一个总质量为 $5$ 的两个砝码的子集，并得到 $\{1, 4\}$。显然，剩余的两个砝码质量均为 $2$ 克。

在第二个例子中，我们可以查询一个总质量为 $8$ 的两个砝码的子集，唯一可能的结果是 $\{4, 4\}$。可以证明：仅通过一次查询无法确定三个砝码的质量，但此处不给出该证明。