#include <bits/stdc++.h>
using ll = long long int;
using namespace std;
struct R {
  ll i, v;
};
bool cmp(R a, R b) { return a.v > b.v; }
ll gcd(ll a, ll b) { return !(a % b) ? b : gcd(b, a % b); }
int main() {
  ll n, m, sum = 0, i, mx = -1e9;
  scanf("%lld", &n);
  ll a[n + 5], b[n + 5];
  for (i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
    sum += a[i];
    mx = max(mx, a[i]);
  }
  for (i = 0; i < n; i++) b[i] = mx - a[i];
  ll g = b[0], sumb = b[0];
  if (!b[0]) g = b[1];
  for (i = 1; i < n; i++) {
    sumb += b[i];
    if (b[i]) g = gcd(g, b[i]);
  }
  printf("%lld %lld\n", sumb / g, g);
  return 0;
}
