#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 5;
long long v[MAX];
long long GCD(long long a, long long b) {
  if (!b) return a;
  if (!a) return b;
  return GCD(b, a % b);
}
int main() {
  long long mx = 0;
  long long n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> v[i];
    mx = max(v[i], mx);
  }
  long long G = 0;
  for (int i = 1; i <= n; i++) {
    G = GCD(mx - v[i], G);
  }
  long long ans1 = 0;
  for (int i = 1; i <= n; i++) {
    ans1 += (mx - v[i]) / G;
  }
  cout << ans1 << " " << G << "\n";
  return 0;
}
