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.


-----Input-----

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.


-----Output-----

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.


-----Examples-----
Input
5
1 1 1 5 1

Output
5
Input
5
2 2 3 2 2

Output
5


-----Note-----

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.

Difficulty: interview

Starter code:

Solutions:
n = int(input())
a = list(map(int,input().split()))
s = sum(a)
for k in range(max(a), 999999):
    vote = sum(k-x for x in a)
    if vote > s: print(k); break

n=int(input())
ar=list(map(int,input().split()))
k=max(ar)
while True:
    s1,s2=0,0
    for e in ar:
        s1+=e
        s2+=k-e
    if(s2>s1):
        break
    k+=1
print(k)

n = int(input())
s = list(map(int, input().split()))
sm = sum(s)
mx = max(s)
for i in range(mx, 1000000):
    if i * n - sm > sm:
        print(i)
        break

n = int(input())
a = list(map(int, input().split()))
s = sum(a)
mx = max(a)
while(n*mx-s <= s):
    mx+=1
print(mx)

def scand():
    return int(input())
def scana():
    return [int(x) for x in input().split()]
n=scand()
a=scana()
summ=sum(a)
for i in range(max(a),10000):
    if(i*n-summ>summ):
        print(i)
        break


from sys import stdin, stdout
from math import sin, tan, cos

n = int(stdin.readline())
vl = list(map(int, stdin.readline().split()))

for i in range(max(vl), 300):
    if i * n - sum(vl) > sum(vl):
        stdout.write(str(i))
        break

n = int(input())
a = list(map(int, input().split()))
k = max(a)
s = sum(a)
while s >= k * n - s:
	k += 1
print(k)

n = int(input())
a = [int(i) for i in input().split()]
c = max(a)
while True:
    x = 0
    y = 0
    for el in a:
        x += el
        y += c - el
    if x < y:
        break
    c += 1
print(c)


n = int(input())
arr = list(map(int,input().split()))
k = max(arr)

a = sum(arr)
b = 0
while b <= a:
    b = sum(k - x for x in arr)
    k += 1
print(k - 1)



n = int(input())
num = list(map(int, input().split()))
x = max(num)
s = sum(num)
for i in range(x, 250):
    if i * n - s > s:
        print(i)
        break

n = int(input())
a = list(map(int, input().split()))

k = max(a)
s = sum(a)

while s >= k * n - s:
    k += 1

print(k)


n = int( input() )
a = list( map( int, input().split() ) )
s = sum( a )

k = max( a )
while True:
    if n * k - s > s:
        print( k )
        break
    k += 1



n = int(input())

A = [int(x) for x in input().split()]

s = sum(A)
M = max(A)

# Look for num M, M+1...

for K in range(M, M+300):
    votes = K*n - s
    if votes > s:
        print(K)
        break


def go():
    n = int(input())
    a = [int(i) for i in input().split(' ')]
    x = max(a)
    s1 = 0
    s2 = 0
    for i in range(n):
        s1 += a[i]
        s2 += x - a[i]
    if s2 > s1:
        return x
    while s1 >= s2:
        x += 1
        s2 += n
    return x

print(go())


n = int(input())
arr = list(map(int, input().split()))
o = sum(arr)
for i in range(max(arr), 10 ** 5):
    if i * n - o > o:
        print(i)
        break

# -*- coding: utf-8 -*-

import math
import collections
import bisect
import heapq
import time
import random
import itertools
import sys

"""
created by shhuan at 2018/10/20 22:37

"""

"""
# Definition for a Node.
"""


N = int(input())
A = [int(x) for x in input().split()]

e = 2 * sum(A)

ans = max(e // N + 1, max(A))
print(ans)

def ii():
    return int(input())
def mi():
    return map(int, input().split())
def li():
    return list(mi())

n = ii()
a = li()
s = sum(a)
k = max(a)
while 1:
    if n * k - s > s:
        print(k)
        break
    k += 1

gcd = lambda a, b: gcd(b, a % b) if b else a


def main():
    n = int(input())
    arr = list(map(int, input().split()))

    d = max(arr)

    while True:
        res = 0
        for i in arr:
            res += d - i
        if res > sum(arr):
            print(d)
            return
        d += 1


main()

n=int(input())
arr=list(map(int,input().split()))
maxval=max(arr)
sumx=sum(arr)
flag=0
while((maxval)*n-sumx<=sumx):
    maxval+=1
print(maxval)



from math import ceil

n = int(input())
votes = list(map(int, input().strip().split()))

sumv = sum(votes)
print(max(1+(2*sumv//n), max(votes)))

n = int(input())
xs = list(map(int, input().split()))
max_x = max(xs)
bad = sum(xs)
good = sum(max_x - x for x in xs)
ans = 0
while True:
    if ans * n + good > bad:
        print(ans + max_x)
        break
    ans += 1


x = int(input())
a = [int(x) for x in input().split()]
s = 0
mx = 0
for x in a:
	if x > mx:
		mx = x
	s += x
k = mx
while (True):
	s1 = 0
	for x in a:
		s1 += k - x
	if s1 > s:
		print(k)
		return
	k += 1


n = int(input())
a = input().split()
e = 0
for i in range(n):
    e += int(a[i])
mini = ((2*e)//n)+1
for i in range(n):
    mini = max(int(a[i]),mini)
print(mini)




def __starting_point():

    n = int(input())

    A = [int(num) for num in input().split(' ')]

    opponent_votes = sum(A)
    min_k = max(A)

    while sum([min_k - a for a in A]) <= opponent_votes:
        min_k += 1

    print(min_k)
__starting_point()

n=int(input())
a=list(map(int,input().split()))
s=sum(a)
m=max(a)
while True:
    if n*m-s>s:
        print(m)
        break
    else:
        m+=1