#include <bits/stdc++.h>   using namespace std;   bool isPrime[1000005] = {false};   vector<long long int> SPF(1000005);   long long int fastPower(long long int a, long long int b) {     if (b == 0) return 1;     long long int prod = 1;     while (b > 0) {       if (b & 1) prod = prod * a;       b = b >> 1;       a = a * a;     }     return prod;   }   void sieve() {     int i;     for (i = 2; i < 1000005; ++i) isPrime[i] = 1;     for (i = 2; i * i < 1000005; ++i) {       if (isPrime[i]) {         for (int j = i * i; j < 1000005; j += i) isPrime[j] = 0;       }     }   }   void printa(bool f) {     if (f)       cout <<  YES ;     else       cout <<  NO ;     cout <<   n ;   }   bool flip(bool f) {     if (f) return 0;     return 1;   }   void solve() {     long long int i, n;     cin >> n;     vector<long long int> a(n);     for (i = 0; i < n; ++i) cin >> a[i];     sort(a.begin(), a.end());     long long int s = 0, m = a[n - 1];     for (i = 0; i < n - 1; ++i) s += a[i];     cout << abs(m - s) + 1 <<   n ;   }   int main() {     int tc = 1;     while (tc--) {       solve();     }     return 0;   }   