import sys

def compute_f(X, A):
    if X == 0:
        return 0
    prev = -1
    count = 0
    for a in A:
        k = a // X
        if k != prev:
            count += 1
            prev = k
    return (X + 1) * count

def find_min_f(A, N):
    max_A = A[-1]
    min_f = float('inf')
    best_X = 0
    # Iterate over possible X values
    for X in range(1, int(max_A ** 0.5) + 2):
        current_f = compute_f(X, A)
        if current_f < min_f or (current_f == min_f and X < best_X):
            min_f = current_f
            best_X = X
    # Also consider X up to max(A)
    for X in range(1, max_A + 1):
        current_f = compute_f(X, A)
        if current_f < min_f or (current_f == min_f and X < best_X):
            min_f = current_f
            best_X = X
    # Also check X larger than max_A
    X = max_A
    current_f = compute_f(X, A)
    if current_f < min_f:
        min_f = current_f
        best_X = X
    X = max_A + 1
    current_f = compute_f(X, A)
    if current_f < min_f:
        min_f = current_f
        best_X = X
    return best_X, min_f

def main():
    input = sys.stdin.read().split()
    N = int(input[0])
    A = list(map(int, input[1:N+1]))
    if N == 0:
        print(0)
        print(0)
        return
    best_X, min_f = find_min_f(A, N)
    print(best_X)
    print(min_f)

if __name__ == "__main__":
    main()