#include <bits/stdc++.h>
using namespace std;
set<long long> sss;
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
int main() {
  long long n, lc, mm = -1, mmm = 1000000000000;
  cin >> n;
  long long a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    sss.insert(a[i]);
    mm = max(mm, a[i]);
    mmm = min(a[i], mmm);
  }
  lc = 0;
  if (n == 2) {
    cout << "1 " << max(a[0], a[1]) - min(a[0], a[1]);
    return 0;
  }
  for (int i = 0; i < n; i++) lc = gcd(lc, mm - a[i]);
  long long y = 0;
  if (sss.size() == 2) {
    lc = mm - mmm;
  }
  for (int i = 0; i < n; i++) {
    y += (mm - a[i]) / lc;
  }
  cout << y << " " << lc;
  return 0;
}
