def main():
    import sys
    input = sys.stdin.read().split()
    N = int(input[0])
    A = list(map(int, input[1:N+1]))
    A.sort()
    
    def compute_f(X):
        if X == 0:
            return float('inf')
        count = 1
        prev = A[0] // X
        for a in A[1:]:
            current = a // X
            if current != prev:
                count += 1
                prev = current
        return (X + 1) * count
    
    max_A = A[-1]
    candidates = set()
    for dx in [-2, -1, 0, 1, 2]:
        x = max_A + dx
        if x >= 1:
            candidates.add(x)
    
    # Add some small X candidates
    for x in [1, 2, 3, 4, 5]:
        candidates.add(x)
    
    min_f = float('inf')
    best_X = None
    
    for x in candidates:
        current_f = compute_f(x)
        if current_f < min_f:
            min_f = current_f
            best_X = x
        elif current_f == min_f:
            if x < best_X:
                best_X = x
    
    # Additionally, check X = max_A + 1 if not already in candidates
    x = max_A + 1
    if x >= 1:
        candidates.add(x)
        current_f = compute_f(x)
        if current_f < min_f:
            min_f = current_f
            best_X = x
        elif current_f == min_f:
            if x < best_X:
                best_X = x
    
    print(best_X)
    print(min_f)

if __name__ == '__main__':
    main()