CF1043A.Elections

Awruk is taking part in elections in his school. It is the final round. He has only one opponent — Elodreip. The are $n$ students in the school. Each student has exactly $k$ votes and is obligated to use all of them. So Awruk knows that if a person gives $a_i$ votes for Elodreip, than he will get exactly $k - a_i$ votes from this person. Of course $0 \le k - a_i$ holds.

Awruk knows that if he loses his life is over. He has been speaking a lot with his friends and now he knows $a_1, a_2, \dots, a_n$ — how many votes for Elodreip each student wants to give. Now he wants to change the number $k$ to win the elections. Of course he knows that bigger $k$ means bigger chance that somebody may notice that he has changed something and then he will be disqualified.

So, Awruk knows $a_1, a_2, \dots, a_n$ — how many votes each student will give to his opponent. Help him select the smallest winning number $k$. In order to win, Awruk needs to get strictly more votes than Elodreip.

阿武鲁克正在参加学校的选举。现在是最后一轮。他只有一个对手——埃洛德雷普。学校共有 $n$ 名学生，每名学生恰好有 $k$ 票，并且必须全部投出。因此阿武鲁克知道：若某位学生给埃洛德雷普投了 $a_i$ 票，则此人将给他本人投恰好 $k - a_i$ 票。显然，必须满足 $0 \le k - a_i$。

阿武鲁克深知：一旦落败，他的生命就将终结。他已与朋友们进行了大量沟通，从而得知 $a_1, a_2, \dots, a_n$ —— 即每位学生打算投给对手的票数。现在，他希望调整 $k$ 的值以赢得选举。当然，他清楚：$k$ 越大，越可能被人察觉其篡改行为，从而导致自己被取消资格。

因此，阿武鲁克已知 $a_1, a_2, \dots, a_n$ —— 即每位学生将投给对手的票数。请帮他选出最小的、能确保获胜的 $k$ 值。为赢得选举，阿武鲁克获得的总票数必须严格大于埃洛德雷普的总票数。

The first line contains integer $n$ ($1 \le n \le 100$) — the number of students in the school.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ ($1 \leq a_i \leq 100$) — the number of votes each student gives to Elodreip.

第一行包含一个整数 $n$（$1 \le n \le 100$）—— 表示学校中学生的数量。

第二行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$1 \leq a_i \leq 100$）—— 表示每位学生投给 Elodreip 的票数。

Output the smallest integer $k$ ($k \ge \max a_i$) which gives Awruk the victory. In order to win, Awruk needs to get strictly more votes than Elodreip.

输出满足条件的最小整数 $k$（$k \ge \max a_i$），使得 Awruk 获胜。为赢得胜利，Awruk 的票数必须严格多于 Elodreip 的票数。

In the first example, Elodreip gets $1 + 1 + 1 + 5 + 1 = 9$ votes. The smallest possible $k$ is $5$ (it surely can't be less due to the fourth person), and it leads to $4 + 4 + 4 + 0 + 4 = 16$ votes for Awruk, which is enough to win.

In the second example, Elodreip gets $11$ votes. If $k = 4$, Awruk gets $9$ votes and loses to Elodreip.

在第一个例子中，Elodreip 获得了 $1 + 1 + 1 + 5 + 1 = 9$ 票。最小可能的 $k$ 是 $5$（由于第四个人的存在，$k$ 显然不能更小），此时 Awruk 获得 $4 + 4 + 4 + 0 + 4 = 16$ 票，足以获胜。

在第二个例子中，Elodreip 获得了 $11$ 票。若 $k = 4$，Awruk 获得 $9$ 票，输给 Elodreip。