def main():
    import sys
    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
    
    A.sort()
    D = []
    for i in range(len(A)-1):
        D.append(A[i+1] - A[i])
    max_D = max(D) if D else 0
    max_A = max(A) if A else 0
    
    candidates = set()
    for d in D:
        candidates.add(d)
        candidates.add(d + 1)
    candidates.add(max_D)
    candidates.add(max_D + 1)
    candidates.add(max_A)
    candidates.add(max_A + 1)
    
    # Also include small X's
    for x in range(1, 100):
        candidates.add(x)
    
    min_f = float('inf')
    min_X = 0
    
    for X in candidates:
        if X == 0:
            continue
        s = set()
        for a in A:
            q = a // X
            s.add(q)
        K = len(s)
        current_f = (X + 1) * K
        if current_f < min_f:
            min_f = current_f
            min_X = X
        elif current_f == min_f and X < min_X:
            min_X = X
    
    print(min_X)
    print(min_f)

if __name__ == "__main__":
    main()