#include <bits/stdc++.h>
using namespace std;
int n;
long long a[200500];
long long b[200500];
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
  int n;
  cin >> n;
  long long maxx = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    maxx = max(maxx, a[i]);
  }
  int ans = 0;
  long long sum = 0;
  for (int i = 1; i <= n; i++) {
    if (maxx - a[i] != 0) b[ans++] = maxx - a[i], sum += maxx - a[i];
  }
  long long gccd = b[0];
  for (int i = 1; i < ans; i++) {
    gccd = gcd(gccd, b[i]);
  }
  cout << sum / gccd << " " << gccd << endl;
  return 0;
}
