#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e18 + 7;
const int maxn = 2e5 + 10;
const long long linf = 1e18;
const int inf = 0x3f3f3f3f;
long long qpow(long long a, long long b) {
  return b ? ((b & 1) ? a * qpow(a * a % MOD, b >> 1) % MOD
                      : qpow(a * a % MOD, b >> 1)) %
                 MOD
           : 1;
}
long long qpow(long long a, long long b, long long c) {
  return b ? ((b & 1) ? a * qpow(a * a % MOD, b >> 1) % c
                      : qpow(a * a % MOD, b >> 1)) %
                 c
           : 1;
}
inline int ird() {
  register int x = 0, f = 1;
  register char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
  return x * f;
}
inline long long lrd() {
  register long long x = 0, f = 1;
  register char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
  return x * f;
}
void puts1() { cout << "-1" << endl; }
void puts2() { cout << "YES" << endl; }
void puts3() { cout << "NO" << endl; }
int gcd(int a, int b) { return (b > 0) ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
long long lgcd(long long a, long long b) { return (b > 0) ? gcd(b, a % b) : a; }
long long llcm(long long a, long long b) { return a * b / lgcd(a, b); }
long long a[maxn];
int main() {
  int n = ird();
  for (int i = 1; i <= n; i++) {
    a[i] = lrd();
  }
  sort(a + 1, a + 1 + n);
  long long z = a[n] - a[1];
  for (int i = 1; i <= n; i++) {
    if (a[n] != a[i]) z = lgcd(a[n] - a[i], z);
  }
  long long y = 0;
  for (int i = 1; i <= n; i++) {
    y += (a[n] - a[i]) / z;
  }
  cout << y << " " << z << endl;
  return 0;
}
