#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long findGCD(long long arr[], int n) {
  long long result = arr[0];
  for (int i = 1; i < n; i++) result = gcd(arr[i], result);
  return result;
}
int main() {
  int n;
  cin >> n;
  long long a[n];
  long long max = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] > max) max = a[i];
  }
  long long b[n];
  long long sum = 0;
  for (int i = 0; i < n; i++) {
    b[i] = max - a[i];
    sum = sum + b[i];
  }
  long long z = findGCD(b, n);
  long long y = sum / z;
  cout << y << " " << z << endl;
  return 0;
}
