#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 2;
int n, i, j, poz, ok = 1, x[N], maxx, a, b, r;
long long ans;
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> x[i];
    if (x[i] > maxx) maxx = x[i];
  }
  for (i = 1; i <= n && ok; i++)
    if (x[i] != maxx) {
      poz = i;
      ok = 0;
    }
  ans += maxx - x[poz];
  a = ans;
  for (i = poz + 1; i <= n; i++)
    if (x[i] != maxx) {
      b = maxx - x[i];
      ans += b;
      r = a % b;
      while (r) {
        a = b;
        b = r;
        r = a % b;
      }
      a = b;
    }
  if (b == 0) b = a;
  cout << ans / b << " " << b;
}
