import math

def main():
    import sys
    input = sys.stdin.read().split()
    N = int(input[0])
    A = list(map(int, input[1:N+1]))
    A.sort()
    max_A = A[-1]

    candidates = set()
    for a in A:
        if a == 0:
            continue
        k = int(math.sqrt(a))
        if k > 0:
            candidates.add(k)
            candidates.add(k-1)
            candidates.add(k+1)
        k = int(math.sqrt(a)) + 1
        candidates.add(k)
    candidates.add(1)
    candidates.add(max_A)
    candidates.add(max_A + 1)
    candidates.add(0)
    candidates = [x for x in candidates if x >= 1]
    candidates.sort()

    best_X = 1
    min_f = float('inf')
    
    for X in candidates:
        current = set()
        for a in A:
            q = a // X
            current.add(q)
            if len(current) > min_f:
                break  # 优化，提前退出
        D = len(current)
        f = (X + 1) * D
        if f < min_f or (f == min_f and X < best_X):
            min_f = f
            best_X = X

    print(best_X)
    print(min_f)

if __name__ == '__main__':
    main()