#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5;
int result;
long long num;
int maxNum = -1;
int a[MAXN];
int b[MAXN];
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    int tmp;
    cin >> tmp;
    a[i] = tmp;
    maxNum = max(maxNum, tmp);
  }
  for (int i = 1; i <= n; i++) {
    b[i] = maxNum - a[i];
    result = gcd(result, b[i]);
  }
  for (int i = 1; i <= n; i++) {
    num += (maxNum - a[i]) / result;
  }
  cout << num << " " << result << endl;
  return 0;
}
