# coding: utf-8
import collections, copy, heapq, itertools, math, sys
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    N = II()
    x = ILI()
    return N, x


def solve(N, x):
    x.sort()
    ans = x[-1]
    for i in range(N - 1):
        ans += x[i] // 2
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()