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