#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, last_dist, current_dist, min_dist = 0, a[101];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
min_dist = 2 * a[0];
for (int i = 1; i < n; i++) {
last_dist = a[i];
if (a[i] - a[i - 1] > 0) {
min_dist += a[i] - a[i - 1];
}
min_dist += a[i];
}
cout << min_dist << "\n";
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgbiwgbGFzdF9kaXN0LCBjdXJyZW50X2Rpc3QsIG1pbl9kaXN0ID0gMCwgYVsxMDFdOwoJY2luID4+IG47Cglmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewoJCWNpbiA+PiBhW2ldOwoJfQoJc29ydChhLCBhICsgbik7CgltaW5fZGlzdCA9ICAyICogYVswXTsKCWZvciAoaW50IGkgPSAxOyBpIDwgbjsgaSsrKSB7CgkJbGFzdF9kaXN0ID0gYVtpXTsKCQlpZiAoYVtpXSAtIGFbaSAtIDFdID4gMCkgewoJCQltaW5fZGlzdCArPSBhW2ldIC0gYVtpIC0gMV07CgkJfQoJCW1pbl9kaXN0ICs9IGFbaV07Cgl9Cgljb3V0IDw8IG1pbl9kaXN0IDw8ICJcbiI7CglyZXR1cm4gMDsKfQ==