#define _USE_MATH_DEFINES
#include <sstream> //string stream its useful!
#include<string>
#include<iostream>
#include<utility> //pair
#include <vector> // vector
#include <algorithm>    // swap,sort,binary_search
#include <functional>   // std::greater
#include <map> //map
#include<set> //set
#include<queue> //queue
#include<list> //list
#include<cmath>
#include<numeric>
#include<cassert>
#include <iomanip> //cout<<setprecision
#include <regex>
#include <ctype.h> //toupper case
#include <tuple>

typedef long long ll;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
ll W = 1000000007;


using namespace std;
void omajinai() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<setprecision(15);
}

class Main{
public:
    int N;
    vector<int> x;
    Main(){
        cin>>N;
        x = vector<int>(N);
        REP(i,N) cin>>x[i];
    }
    
    long saiyo(){
        vector<int> y(N);
        REP(i,N) y[i] = x[i] - x[i]/2;
        return x[distance(y.begin(),max_element(y.begin(),y.end()))];
    }
    
    void run(){
        
        const long s = saiyo();
        const long ans = accumulate(x.begin(),x.end(),0L,[](long l,int x){
            return l + x/2;
        }) - s/2 + s;
        cout<<ans<<endl;
    }
};

#ifndef gtest
int main(){
    omajinai();
    Main().run();
    return 0;
}
#endif