#include <bits/stdc++.h>
using namespace std;
int a[200005];
vector<long long> v;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
  int n, i, j, maxx = 0;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    maxx = max(maxx, a[i]);
  }
  long long l;
  for (i = 1; i <= n; i++) {
    l = maxx - a[i];
    if (l > 0) {
      v.push_back(l);
    }
  }
  if (v.size() == 1) {
    cout << 1 << " " << v[0] << endl;
    return 0;
  }
  int len = v.size();
  long long minn, ans = 0;
  minn = gcd(v[0], v[1]);
  for (i = 1; i < len - 1; i++) {
    minn = min(gcd(v[i], v[i + 1]), minn);
  }
  for (i = 0; i < len; i++) {
    ans += (v[i] / minn);
  }
  cout << ans << " " << minn;
  return 0;
}
