import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] a = new int[n];int sum=0; for(int a_i = 0; a_i < n; a_i++){ a[a_i] = in.nextInt(); } int arr[]=sort(a); int t= findind(a,0,arr[arr.length-1]); int b= findind(a,0,arr[arr.length-2]); n=arr[t];int y=arr[b]; //gcd int rem; while(n%y!=0) { rem=n%y; n=y; y=rem; } int gcd=y; sum=arr[t]+arr[b]; int max; if(arr[t]>arr[b]) max=arr[t]; else max=arr[b]; int ans=gcd*(sum-max);//System.out.println(gcd);System.out.println(sum);System.out.println(max); System.out.println(ans); } public static int[] sort(int[] arr) { int i,j; for(i=0;iarr[j+1]) { int temp=arr[j]; arr[j]=arr[j+1]; arr[j+1]=temp; } } } return arr; } public static int findind(int[] arr, int vidx, int data) { if (vidx == arr.length) return -1; if (arr[vidx] == data) return vidx; int rv = findind(arr, vidx + 1, data); return rv; } }