#include <bits/stdc++.h>
using namespace std;
long long int insig;
void Out(vector<long long int> x) {
  for (long long int i = 0; i < x.size(); i++) {
    cout << x[i] << " ";
  }
  cout << endl;
}
long long int gcd2(long long int a, long long int b) {
  while (a > 0 && b > 0) {
    if (a >= b) {
      a -= (b * (a / b));
    } else {
      b -= (a * (b / a));
    }
  }
  if (a == 0) {
    return b;
  } else {
    return a;
  }
}
long long int gcd(vector<long long int> a) {
  long long int x, y;
  while (a.size() >= 2) {
    x = a[a.size() - 1];
    y = a[a.size() - 2];
    a.pop_back();
    a.pop_back();
    a.push_back(gcd2(x, y));
  }
  return a[0];
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long int N;
  cin >> N;
  vector<long long int> a;
  for (long long int IBRO = 0; IBRO < N; IBRO++) {
    cin >> insig;
    a.push_back(insig);
  };
  vector<long long int> dif;
  for (long long int i = 0; i < N - 1; i++) {
    dif.push_back(abs(a[i + 1] - a[i]));
  }
  long long int z = gcd(dif);
  long long int mv = -1;
  for (long long int i = 0; i < N; i++) {
    mv = max(mv, a[i]);
  }
  long long int y = 0;
  for (long long int i = 0; i < N; i++) {
    y += ((mv - a[i]) / z);
  }
  cout << y << " " << z << endl;
  return 0;
}
