#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>
#include <stack>

using namespace std;

#define ll long long int

ll n;
vector<ll> vs;

int main()
{
    ll n;
    cin >> n;
    vector<ll> vs(n);
    for(int i = 0;i < n;i++)
    {
        cin >> vs[i];
    }
    sort(vs.begin(), vs.end(), greater<ll>());
    ll sum = 0;
    for(int i = 0;i < n;i++)
    {
        if(i > 0)
        {
            vs[i] /= 2;
        }
        sum += vs[i];
    }
    cout << sum << endl;
    return 0;
}