#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 20;
long long a[maxn], b[maxn];
bool cmp(long long a, long long b) { return a > b; }
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
int main() {
  int n;
  cin >> n;
  int cnt = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    if (a[i] != a[n]) {
      b[cnt++] = a[n] - a[i];
    }
  }
  if (n == 2) {
    cout << 1 << " " << a[2] - a[1] << endl;
    return 0;
  }
  long long x = b[0];
  for (int i = 1; i < cnt; i++) {
    x = gcd(x, b[i]);
  }
  long long people = 0;
  for (int i = 0; i < cnt; i++) {
    people += b[i] / x;
  }
  cout << people << " " << x << endl;
  return 0;
}
