#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define pii pair<int, int>
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 1000'000'007, N = 55, K = 22, C = 28;
int add(int x, int y){x+=y; if(x>=mod) x-=mod; return x;}
int mul(int x, int y){return ((ll)x)*y%mod;}

int n,a[5];
ll res;

vector<int> vec;
void dfs(int cur){
    if(cur==(1<<n)){
        int b[5];
        memcpy(b,a,sizeof a);
        for(auto s: vec) for(int i=0; i<n; ++i) if(s>>i&1) b[i]--;
        bool ok=1;
        for(int i=0; i<n; ++i) if(b[i]<0) ok=0;
        if(ok) res=min(res,sz(vec)+accumulate(b,b+n,0ll));
        return;
    }
    dfs(cur+1);
    if(__builtin_popcount(cur)>1){
        bool ok=1;
        for(auto s: vec) if(__builtin_popcount(cur&s)>1) ok=0;
        if(ok){
            vec.pb(cur);
            dfs(cur+1);
            vec.pop_back();
        }
    }
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    cin >> n;
    for(int i=0; i<n; ++i) cin >> a[i];
    res=4e18;
    dfs(0);
    cout << res << "\n";
}