#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  if (b == 0) return a;
  long long int r;
  while (b > 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
int main() {
  long long int i, j, k, l, m, n, o, p, q, r, s, t, a[1000000];
  cin >> n;
  m = 0;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    m = max(m, a[i]);
  }
  k = 0;
  for (i = 0; i < n; i++) {
    if (a[i] != m) {
      k = gcd(k, m - a[i]);
    }
  }
  j = 0;
  for (i = 0; i < n; i++) {
    j = j + ((m - a[i]) / k);
  }
  cout << j << " " << k << endl;
  return 0;
}
