#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long max(long long a, long long b) {
  if (a > b) return a;
  return b;
}
int main() {
  int n;
  cin >> n;
  long long a[n];
  for (int i = 0; i < n; ++i) cin >> a[i];
  long long sum = 0, maxm = 0, g = 0;
  for (int i = 0; i < n; ++i) maxm = max(maxm, a[i]);
  for (int i = 0; i < n; ++i) sum = sum + labs(maxm - a[i]);
  for (int i = 1; i < n; ++i) g = gcd(g, labs(a[i] - a[i - 1]));
  cout << sum / g << " " << g << endl;
}
