#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<stack>
#include<queue>
#include<string.h>
#include<array>
#include<algorithm>
#include<cmath>
using namespace std;
#define int long long
const int maxn = 5e5;
const int oo = 1e18;
struct ST{
int n;
vector<int> tree;
ST(int size){
n = size;
tree.resize(4 * n);
}
void build(int node, int start, int end, vector<int>& a){
if(start == end){
tree[node] = a[start];
}
else{
int mid = (start + end) / 2;
build(2 * node, start, mid, a);
build(2 * node + 1, mid + 1, end, a);
tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}
}
int query(int node, int start, int end, int l, int r){
if(start > r || end < l) return -oo;
if(start >= l && end <= r) return tree[node];
int mid = (start + end) / 2;
int l1 = query(2 * node, start, mid, l, r);
int r1 = query(2 * node + 1, mid + 1, end, l, r);
return max(l1, r1);
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
bool is = 0;
if(n <= 3){
if(n == 3){
cout << min({max({a[0], a[1], a[2]}) * n, a[0] + 2 * (max(a[1], a[2]) + a[0]), a[0] + a[0] + a[1] + a[0] + a[1] + a[2], max(a[0], a[1]) * 2 + max(a[0], a[1]) + a[2]});
}
else if(n == 2){
cout << min({max(a[0], a[1]) * n, a[0] + a[0] + a[1]});
}
else{
cout << a[0];
}
}
else{
cout << a[0] * n;
}
}
