#include <stdio.h>
#include <stdlib.h>

long long numberOfWeeksForWhichYouCanWork(int* milestones, int n) {
    long long total = 0;
    int maxMilestone = 0;
    
    for (int i = 0; i < n; i++) {
        total += milestones[i];
        if (milestones[i] > maxMilestone) {
            maxMilestone = milestones[i];
        }
    }
    
    // If largest project has more than half + 1 of total work
    // it becomes the bottleneck
    if (maxMilestone > total - maxMilestone) {
        // We can only work: other projects + gaps between them
        return 2 * (total - maxMilestone) + 1;
    } else {
        // We can complete all milestones by clever alternating
        return total;
    }
}

int main() {
    int n;
    scanf("%d", &n);
    int* milestones = (int*)malloc(n * sizeof(int));
    for (int i = 0; i < n; i++) {
        scanf("%d", &milestones[i]);
    }
    printf("%lld\n", numberOfWeeksForWhichYouCanWork(milestones, n));
    free(milestones);
    return 0;
}