import java.io.*;
import java.util.*;

public class D {

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }

    static InputReader r = new InputReader(System.in);
    static PrintWriter pw = new PrintWriter(System.out);

    static long n;
    public static void main(String[] args) {
        
        n = r.nextLong();
        long[] ar = new long[(int)n];
        for(int i = 0; i < n; i++){
            ar[i] = r.nextLong();
        }
        long max = max(ar);

        long[] arr = new long[(int)n];
        for(int i = 0; i < n; i++){
            arr[i] = max - ar[i];
        }
        long sum = sum(arr);
        long gcd = gcdarr(arr);
        pw.print(sum / gcd);
        pw.println(" " + gcd);

        pw.close();
    }

    public static long max(long[] arr){
        long max = Integer.MIN_VALUE;
        for(int i = 0; i < n; i++){
            max = Math.max(max, arr[i]);
        }
        return max;
    }

    public static long sum(long[] arr){
        long ans = 0;
        for(int i = 0; i < n; i++){
            ans += arr[i];
        }
        return ans;
    }

    public static long gcd(long a, long b) { 
        if (a == 0){
            return b;
        } 
        return gcd(b % a, a); 
    } 

    public static long gcdarr(long[] arr){
        long ans = arr[0];
        for(int i = 1; i < n; i++){
            if(arr[i] != 0){
                ans = gcd(ans, arr[i]);
            }
        }
        return ans;
    }
}

/**
*                _        _                 _                                                
*               | |      | |               | |                                               
*   ___ ___   __| | ___  | |__  _   _    __| | __ _ _ __ _ __ ___ _ __     _   _  __ _  ___  
*  / __/ _ \ / _` |/ _ \ | '_ \| | | |  / _` |/ _` | '__| '__/ _ \ '_ \   | | | |/ _` |/ _ \ 
* | (_| (_) | (_| |  __/ | |_) | |_| | | (_| | (_| | |  | | |  __/ | | |  | |_| | (_| | (_) |
*  \___\___/ \__,_|\___| |_.__/ \__, |  \__,_|\__,_|_|  |_|  \___|_| |_|   \__, |\__,_|\___/ 
*                                __/ |                               ______ __/ |            
*                               |___/                               |______|___/             
 */