#include <bits/stdc++.h>
using namespace std;
long long arr[200000], brr[200000];
long long gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); }
int main() {
  int n;
  while (cin >> n) {
    long long num = 0;
    for (int i = 0; i < n; i++) {
      cin >> arr[i];
    }
    sort(arr, arr + n);
    for (int i = 0; i < n - 1; i++) {
      brr[i] = arr[n - 1] - arr[i];
    }
    for (int i = 0; i < n - 2; i++) {
      brr[i + 1] = gcd(brr[i], brr[i + 1]);
    }
    for (int i = 0; i < n - 1; i++) {
      num += (arr[n - 1] - arr[i]) / brr[n - 2];
    }
    cout << num << ' ' << brr[n - 2];
  }
  return 0;
}
