#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int n;
vector<int> a(maxn);
vector<int> rem;
int target;
long long total;
int gcd(int a, int b) {
  if (a == 0)
    return b;
  else
    return gcd(b % a, a);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  target = *max_element(a.begin(), a.end());
  for (int i = 0; i < n; i++) {
    int need = (target - a[i]);
    if (need > 0) {
      rem.push_back(need);
      total += need;
    }
  }
  if (rem.size() == 0) {
    cout << 0 << " " << 0 << endl;
  } else if (rem.size() == 1) {
    cout << 1 << " " << total << endl;
  } else {
    int cur = rem[0];
    for (int i = 1; i < rem.size(); i++) {
      cur = gcd(cur, rem[i]);
    }
    cout << (total / cur) << " " << cur << endl;
  }
  return 0;
}
