#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;

ll mod = 1e9 + 7;

ll inv(ll N) {
    ll a = N, b = mod, c = 1, d = 0;
    while (b > 0) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        c -= t * d;
        swap(c, d);

    }
    c %= mod;
    if (c < 0)c += mod;
    return c;

}
int main() {
    ll N;
    cin>>N;
    vll X(N);
    ll it=-1;
    ll M=-1;
    rep(i,N){
        cin>>X[i];
        if(M<X[i]){
            M=X[i];
            it=i;
        }
    }
    //cout<<M<<endl;
    rep(i,N){
        if(i!=it){
            M+=X[i]/2;
        }
    }
    cout<<M<<endl;
}