# encoding:utf-8



import copy

import numpy as np

import random



n = int(eval(input()))



p = []

for i in range(n):

    p.append(int(eval(input())))



answer = sum(p)-max(p)//2



print(answer)

#!/usr/bin/env python3

# encoding:utf-8

import copy

import random

import bisect #bisect_left　これで二部探索の大小検索が行える

import fractions #最小公倍数などはこっち

import math

import sys

import collections

from decimal import Decimal # 10進数で考慮できる



mod = 10**9+7

sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000



d = collections.deque()

def LI(): return list(map(int, sys.stdin.readline().split()))



N = int(eval(input()))

p = [0 for i in range(N)]

for i in range(N):

    p[i] = int(eval(input()))



p.sort()

ans = sum(p)

ans -= p[-1] // 2

print(ans)
# encoding:utf-8
import copy
import numpy as np
import random

n = int(eval(input()))
p = []
for i in range(n):
    p.append(int(eval(input())))
answer = sum(p) - max(p) // 2
print(answer)

#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect  # bisect_left　これで二部探索の大小検索が行える
import fractions  # 最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal  # 10進数で考慮できる

mod = 10**9 + 7
sys.setrecursionlimit(mod)  # 再帰回数上限はでdefault1000
d = collections.deque()


def LI():
    return list(map(int, sys.stdin.readline().split()))


N = int(eval(input()))
p = [0 for i in range(N)]
for i in range(N):
    p[i] = int(eval(input()))
p.sort()
ans = sum(p)
ans -= p[-1] // 2
print(ans)

+#!/usr/bin/env python3 -import numpy as np +import bisect  # bisect_left　これで二部探索の大小検索が行える +import fractions  # 最小公倍数などはこっち +import math +import sys +import collections +from decimal import Decimal  # 10進数で考慮できる -n = int(eval(input())) -p = [] -for i in range(n): -    p.append(int(eval(input()))) -answer = sum(p) - max(p) // 2 -print(answer) +mod = 10**9 + 7 +sys.setrecursionlimit(mod)  # 再帰回数上限はでdefault1000 +d = collections.deque() + + +def LI(): +    return list(map(int, sys.stdin.readline().split())) + + +N = int(eval(input())) +p = [0 for i in range(N)] +for i in range(N): +    p[i] = int(eval(input())) +p.sort() +ans = sum(p) +ans -= p[-1] // 2 +print(ans)