• + 0 comments

    Python sol

    from collections import Counter
    n = int(input())
    X = sorted(map(int, input().split()))
    c = Counter(X)
    print(round(sum(X)/len(X), 1))
    if len(X)%2==0:
        print(round((X[len(X)//2]+X[len(X)//2-1])/2, 1))
    else:
        print(X[len(X)//2])
    najw = max(c.values())
    print(min([x[0] for x in c.items() if x[1]==najw]))