#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 100, INF = 2e10 + 100;
long long m, x, c;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
inline void solve(int test_id) {
  long long n, ans = 0, mn = INF;
  map<long long, long long> mpp;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    mpp[a[i]]++;
  }
  sort(a, a + n);
  long long gcdd, cnt = a[n - 1];
  if ((int)mpp.size() == 2) {
    long long b = abs(a[0] - cnt);
    for (long long i = 0; i < n; i++) {
      if (cnt - a[i] != 0) ans++;
    }
    cout << ans << " " << b << "\n";
    return;
  }
  vector<long long> v;
  for (long long i = 0; i < n - 1; i++)
    if (cnt - a[i] != 0) v.push_back(cnt - a[i]);
  gcdd = v[0];
  for (long long i = 0; i < (int)v.size(); i++) {
    gcdd = gcd(gcdd, v[i]);
  }
  for (long long i = 0; i < n; i++) {
    ans += (cnt - a[i]) / gcdd;
  }
  cout << ans << " " << gcdd << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test_count = 1;
  for (int test = 0; test < test_count; test++) {
    solve(test);
  }
}
