import sys

import math

import bisect

import numpy as np

input = sys.stdin.readline

MOD = 10**9 + 7

INF = float('INF')



def main():

    n = int(eval(input()))

    v = list(map(float,input().split()))

    v = np.array(v)

    v.sort()



    for i in range(n, 1, -1):

        v[:i] = v[:i] * 0.5



    ans = sum(v)

    print(ans)





if __name__ == '__main__':

    main()
import sys



readline = sys.stdin.readline

MOD = 10 ** 9 + 7

INF = float('INF')

sys.setrecursionlimit(10 ** 5)





def main():

    N = int(readline())

    v = list(map(int, readline().split()))

    v.sort()

    cur = v[0]



    for i in range(1, N):

        cur += v[i]

        cur /= 2



    print(cur)





if __name__ == '__main__':

    main()

import sys
import math
import bisect
import numpy as np

input = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")


def main():
    n = int(eval(input()))
    v = list(map(float, input().split()))
    v = np.array(v)
    v.sort()
    for i in range(n, 1, -1):
        v[:i] = v[:i] * 0.5
    ans = sum(v)
    print(ans)


if __name__ == "__main__":
    main()

import sys

readline = sys.stdin.readline
MOD = 10**9 + 7
INF = float("INF")
sys.setrecursionlimit(10**5)


def main():
    N = int(readline())
    v = list(map(int, readline().split()))
    v.sort()
    cur = v[0]
    for i in range(1, N):
        cur += v[i]
        cur /= 2
    print(cur)


if __name__ == "__main__":
    main()

-import math -import bisect -import numpy as np -input = sys.stdin.readline +readline = sys.stdin.readline +sys.setrecursionlimit(10**5) -    n = int(eval(input())) -    v = list(map(float, input().split())) -    v = np.array(v) +    N = int(readline()) +    v = list(map(int, readline().split())) -    for i in range(n, 1, -1): -        v[:i] = v[:i] * 0.5 -    ans = sum(v) -    print(ans) +    cur = v[0] +    for i in range(1, N): +        cur += v[i] +        cur /= 2 +    print(cur)