#include <bits/stdc++.h>
using namespace std;
long long s1 = 0, s2 = 0, n, x[123456];
int main() {
  scanf("%lld", &n);
  for (int i = 0; i < n; i++) {
    scanf("%lld", &x[i]);
  }
  sort(x, x + n);
  for (int i = n - 1; i >= 0; i--) {
    if (s1 > s2)
      s2 += x[i];
    else
      s1 += x[i];
  }
  printf("%lld", abs(s1 - s2) + 1);
  return 0;
}
