#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7;
const int inf = 1e9 + 7;
const int mod = 1e9 + 7;
int n, a[maxn];
int gcd(int x, int y) { return x % y ? gcd(y, x % y) : y; }
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  int gd = a[1] - a[0];
  for (int i = 2; i < n; i++) {
    int s = a[i] - a[i - 1];
    if (s != 0) gd = gcd(gd, s);
  }
  long long sum = 0;
  for (int i = 0; i < n - 1; i++) {
    sum += (a[n - 1] - a[i]) / gd;
  }
  cout << sum << " " << gd << endl;
  return 0;
}
