#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  long long int ans;
  if (a == 0)
    return b;
  else
    return gcd(b % a, a);
}
long long int fun(vector<long long int> s) {
  long long int g;
  g = s[0];
  long long int i;
  for (i = 1; i < s.size(); i++) {
    g = gcd(g, s[i]);
  }
  return g;
}
int main() {
  int n;
  cin >> n;
  int i, j, k;
  vector<long long int> v, s;
  long long int sum = 0;
  long long int max = 0, temp, g, ans;
  for (i = 0; i < n; i++) {
    cin >> temp;
    if (temp > max) max = temp;
    v.push_back(temp);
  }
  sort(v.begin(), v.end());
  temp = 0;
  for (i = 0; i < n; i++) {
    sum += max - v[i];
    if ((max - v[i]) != temp && max - v[i] > 0) {
      s.push_back(max - v[i]);
      temp = max - v[i];
    }
  }
  g = fun(s);
  ans = sum / g;
  cout << ans << " " << g << endl;
}
