#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 100;
long long a[maxn];
long long myabs(long long x) {
  if (x < 0)
    return -x;
  else
    return x;
}
int main() {
  int n;
  scanf("%d", &n);
  long long sum1 = 0, sum2 = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    sum2 += a[i];
  }
  sort(a + 1, a + n + 1);
  long long ans = inf;
  for (int i = 1; i <= n; i++) {
    sum1 += a[i];
    sum2 -= a[i];
    ans = min(ans, myabs(sum2 - sum1) + 1);
  }
  cout << ans << endl;
  return 0;
}
