#include <bits/stdc++.h>
#include <math.h>

using namespace std;

// c++ short types
#define ll long long
#define vt vector

void whattime() { cout << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl; }

void solve() {
	int n; cin >> n;
	vt<int> a(n), deg(n, 0), subsets;
	for(auto &x: a) {
		cin >> x;
	}
	int res = 0;
	function<void(int)> rec = [&](int i)-> void {
		if(i == n) {
			for(auto x: subsets) for(auto y: subsets) if(x != y) {
						if(__builtin_popcount(x & y) > 1) {
							return ;
						}
					}
			int count = 0;
			for(auto &x: subsets) {
				count += __builtin_popcount(x) - 1;
			}
			res = max(res, count);
			return;
		}
		vt<int> parts;
		auto divide = [&](auto sel, int pos) -> void {
			if(pos == n) {
				bool flag = true;
				for(auto x: subsets) {
					for(auto y: parts) {
						flag = flag && (x != y || __builtin_popcount(x & y) <= 1);
					}
				}
				if(flag) {
					for(auto y: parts) {
						subsets.push_back(y);
					}
					rec(i + 1);
					for(int j = 0; j < parts.size(); ++j) {
						subsets.pop_back();
					}
				}
				return ;
			}
			sel(sel, pos + 1);
			for(auto &v: parts) if(deg[pos] < a[pos]) {
					v ^= 1 << pos;
					deg[pos] ++ ;
					sel(sel, pos + 1);
					deg[pos] --;
					v ^= 1 << pos;
				}
			if(deg[pos] < a[pos] && deg[i] < a[i]) {
				parts.push_back((1 << pos) + (1 << i));
				deg[pos] ++ ;
				deg[i] ++ ;
				sel(sel, pos + 1);
				deg[pos]--;
				deg[i]--;
				parts.pop_back();
			}
		};
		divide(divide, i + 1);
	};
	rec(0);
	cout << accumulate(a.begin(), a.end(), 0ll) - res << "\n";
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int tt = 1;
	for(int t = 0; t < tt; ++t) {
		solve();
	}
	return 0;
}