820 B | 820 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)
BLANK = " "
# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)
def solve():
n = ii()
l = sorted(mii())
mx = 0
ans = -1
for i in range(1, n):
a = l[i - 1]
b = l[i]
mid = (a + b) // 2
if a == mid or b == mid:
continue
diff = min(mid - a, b - mid)
if diff > mx:
mx = diff
ans = mid
p(ans)
if __name__ == "__main__":
tc = 1
for t in range(1, tc+1):
ret = solve()