import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long maximumValue(int[] a) {
        int sum = sum(a);
        int max = max(a);
        int gcdA = gcd(a);
        System.out.println(sum);
        System.out.println(max);
        System.out.println(gcdA);
        long output = (sum-max);
        long out = output*gcdA;
        // Return the maximum value of f among all subsegments [l..r].
        
        return out;
    }
    static int sum (int[] b){
        int sum =0;
        for(int i:b){
            sum+=i;
        }
        return sum;
    }

    static int max (int[] b){
        int max =0;
        for(int i:b){
            if (max < i){
                max = i;
            }else{
                max = max;
            }
        }
        return max;
    }
    static int gcd (int[] b){
        int gcd =b[0];
        for(int i=0;i<b.length;i++){
            gcd = gcdArray(b[i],gcd);
        }
        return gcd;
    }

    static int gcdArray (int a,int b){
        if (a==0){
            return b;
        }
        return gcdArray(b%a,a);
    }

    

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] a = new int[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextInt();
        }
        long result = maximumValue(a);
        System.out.println(result);
        in.close();
    }
}