#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int x[100010];

int main()
{
	int N; cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> x[i];
	}

	sort(x,x+N);

	ll ans = x[N - 1];
	for (int i = 0; i < N - 1; i++)
		ans += x[i] / 2;
	cout << ans << endl;

	return 0;
}