#include <iostream>
#include <algorithm>

using namespace std;

typedef long long LL;

const int N = 100010;

int n, a[N];
LL ans;

int main() {
    // freopen("rpg.in", "r", stdin);
    // freopen("rpg.out", "w", stdout);

    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    
    sort(a + 1, a + n + 1, greater<int>());

    ans = a[1];
    for (int i = 2; i <= n; ++i) ans += a[i] / 2;

    printf("%lld\n", ans);

    return 0;
}