n = int(input())
v = [int(x) for x in input().split(" ")]
maior = max(v)
index = v.index(maior)
v.pop(index)
soma = 0
for i in v:
soma += i
if(soma > maior):
print(soma-maior+1)
else:
print(maior-soma+1)
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long i,k,v,sum,y;
while(cin>>k)
{
sum=0,v=0;
long arr[k];
for(i=0;i<k;i++){
cin>>arr[i];
}
sort(arr,arr+k);
for(i=0;i<k-1;i++)
sum+=arr[i];
cout<<arr[k-1]-sum+1<<endl;
}
return 0;
}1169A - Circle Metro | 780C - Andryusha and Colored Balloons |
1153A - Serval and Bus | 1487C - Minimum Ties |
1136A - Nastya Is Reading a Book | 1353B - Two Arrays And Swaps |
1490E - Accidental Victory | 1335A - Candies and Two Sisters |
96B - Lucky Numbers (easy) | 1151B - Dima and a Bad XOR |
1435B - A New Technique | 1633A - Div 7 |
268A - Games | 1062B - Math |
1294C - Product of Three Numbers | 749A - Bachgold Problem |
1486B - Eastern Exhibition | 1363A - Odd Selection |
131B - Opposites Attract | 490C - Hacking Cypher |
158B - Taxi | 41C - Email address |
1373D - Maximum Sum on Even Positions | 1574C - Slay the Dragon |
621A - Wet Shark and Odd and Even | 1395A - Boboniu Likes to Color Balls |
1637C - Andrew and Stones | 1334B - Middle Class |
260C - Balls and Boxes | 1554A - Cherry |