import sys

def main():
    input = sys.stdin.read().split()
    n = int(input[0])
    A = list(map(int, input[1:n+1]))
    max_A = A[-1]
    min_product = float('inf')
    best_X = 0

    # Iterate X up to 200000 (chosen as a reasonable limit)
    for X in range(1, 200001):
        prev = A[0] // X
        cnt = 1
        for a in A[1:]:
            current = a // X
            if current != prev:
                cnt += 1
                prev = current
        product = (X + 1) * cnt
        if product < min_product or (product == min_product and X < best_X):
            min_product = product
            best_X = X

    # Check X = max_A + 1
    X = max_A + 1
    cnt = 1
    for a in A:
        if a > 0 and (a // X) != 0:
            cnt = 2  # if any element is non-zero, it's 0 and 1
            break
    product = (X + 1) * cnt
    if product < min_product or (product == min_product and X < best_X):
        min_product = product
        best_X = X

    print(best_X)
    print(min_product)

if __name__ == '__main__':
    main()