#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 a[200005];
int main() {
  int n;
  scanf("%d", &n);
  long long ma = -1;
  for (int i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
    ma = max(a[i], ma);
  }
  long long num = 0, cnt = 0, gc, flag = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] != ma) {
      num += ma - a[i];
      if (flag == 0) {
        gc = ma - a[i];
        flag = 1;
      } else {
        gc = gcd(gc, ma - a[i]);
      }
    }
  }
  cout << num / gc << " " << gc;
  return 0;
}
