import java.util.*;

 import java.math.*;

 public class Main {

     public static void main(String [] args){

         Scanner cin = new Scanner(System.in);

         while(cin.hasNext()){

             Integer n;

             n = cin.nextInt();

             int [] t = new int[1005];

             for(int i = 0 ; i<n ; i++)

                 t[i] = cin.nextInt();

             long [] a = new long[1005];

             long [] b = new long[1005];

             for(int i = 0 ; i<n-1 ; i++){

                 int tmp1 = t[i] * t[i+1];

                 int tmp2 = 2 * Math.abs(t[i] - t[i+1]);

                 int k = GCD(tmp1 , tmp2);

                 a[i] = tmp1 / k;

                 b[i] = tmp2 / k;

             }

             BigInteger ans1 = BigInteger.valueOf(a[0]);

             BigInteger ans2 = BigInteger.valueOf(b[0]);

             for(int i = 1 ; i<n-1 ; i++){

                 BigInteger tmp = ans1.gcd(BigInteger.valueOf(a[i]));

                 ans1 = ans1.multiply(BigInteger.valueOf(a[i]));

                 ans1 = ans1.divide(tmp);

                 ans2 = ans2.gcd(BigInteger.valueOf(b[i]));

             }

             System.out.println(ans1 + " " + ans2);

         }

     }

     public static int GCD(int a , int b){

         if(b == 0) return a;

         return GCD(b , a%b);

     }

 }