#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair< int, int >;

int main() {
    int n;
    cin >> n;
    vector<int> x(n);
    rep(i, n) cin >> x[i];
    sort(x.begin(), x.end());
    reverse(x.begin(), x.end());

    ll sum = 0;
    sum = x[0] + floor(x[1]/2.0);
    for (int i=2; i<n; ++i) {
        sum += floor(x[i]/2.0);
    }
    cout << sum << endl;
}