#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
  if (a == 0 || b == 0) return max(a, b);
  return gcd(max(a, b) % min(a, b), min(a, b));
}
int main() {
  int n;
  cin >> n;
  long long int a[n];
  long long int max1 = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    max1 = max(max1, a[i]);
  }
  long long int p = 0;
  for (int i = 0; i < n; i++) p = gcd(p, max1 - a[i]);
  long long int y = 0;
  for (int i = 0; i < n; i++) y = y + (max1 - a[i]) / p;
  cout << y << " " << p;
}
