#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, char* argv[])
{
	int N;
	cin>>N;
	vector<int> x(N);
	int i;
	for (i=0;i<N;i++){
		cin>>x[i];
	}
	sort(x.begin(),x.end());
	int aw=0;
	aw=x[N-1];
	for (i=0;i<N-1;i++){
		aw+=x[i]/2;
	}
	cout<<aw<<endl;
	return 0;
}