Problem: There were n types of swords in the theater basement which had been used during the plays. Moreover there were exactly x swords of each type. y people have broken into the theater basement and each of them has taken exactly z swords of some single type. Note that different people might have taken different types of swords. Note that the values x, y and z are unknown for you.

The next morning the director of the theater discovers the loss. He counts all swords — exactly a_i swords of the i-th type are left untouched.

The director has no clue about the initial number of swords of each type in the basement, the number of people who have broken into the basement and how many swords each of them have taken.

For example, if n=3, a = [3, 12, 6] then one of the possible situations is x=12, y=5 and z=3. Then the first three people took swords of the first type and the other two people took swords of the third type. Note that you don't know values x, y and z beforehand but know values of n and a.

Thus he seeks for your help. Determine the minimum number of people y, which could have broken into the theater basement, and the number of swords z each of them has taken.

Input

The first line of the input contains one integer n (2 ≤ n ≤ 2 ⋅ 10^{5}) — the number of types of swords.

The second line of the input contains the sequence a_1, a_2, ..., a_n (0 ≤ a_i ≤ 10^{9}), where a_i equals to the number of swords of the i-th type, which have remained in the basement after the theft. It is guaranteed that there exists at least one such pair of indices (j, k) that a_j ≠ a_k.

Output

Print two integers y and z — the minimum number of people which could have broken into the basement and the number of swords each of them has taken.

Examples

Input


3
3 12 6


Output


5 3


Input


2
2 9


Output


1 7


Input


7
2 1000000000 4 6 8 4 2


Output


2999999987 2


Input


6
13 52 0 13 26 52


Output


12 13

Note

In the first example the minimum value of y equals to 5, i.e. the minimum number of people who could have broken into the basement, is 5. Each of them has taken 3 swords: three of them have taken 3 swords of the first type, and two others have taken 3 swords of the third type.

In the second example the minimum value of y is 1, i.e. the minimum number of people who could have broken into the basement, equals to 1. He has taken 7 swords of the first type.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &a);
template <class A>
ostream &operator<<(ostream &out, const vector<A> &v);
void swap(int &a, int &b);
vector<int> sieveOfEratosthenes(int n);
bool isPrime(int number);
vector<int> returnAllFactors(int n);
int totalNumberOfDigits(int A);
int extractIthDigit(int A, int i);
int reverseDigits(int A);
vector<int> allPrimeFactors(int A);
int gcdEuclidean(int A, int B);
int lcm(int A, int B);
long long lb(long long target, long long l, long long h);
long long ub(long long target, long long l, long long h);
long long f(long long x) {
  long long answer;
  return answer;
}
void solve() {
  long long t, n, m, l, r, w, x, y, z, k, temp, answer, mini, maxi, miniIndex,
      maxiIndex, counter, sum;
  bool cond, parity;
  string str, str1;
  t = 1;
  while (t--) {
    cin >> n;
    vector<long long> a(n);
    maxi = INT32_MIN;
    for (int i = 0; i < int(n); i++) {
      cin >> a[i];
      maxi = max(maxi, a[i]);
    }
    answer = 0;
    long long gcdValue;
    gcdValue = maxi - a[0];
    sum = maxi - a[0];
    for (int i = 1; i < n; i++) {
      gcdValue = gcdEuclidean(gcdValue, maxi - a[i]);
      sum += (maxi - a[i]);
    }
    answer = sum / gcdValue;
    cout << answer << " " << gcdValue << '\n';
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
template <class A, class B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
  return out << "(" << a.first << ", " << a.second << ")";
}
template <class A>
ostream &operator<<(ostream &out, const vector<A> &v) {
  out << "[";
  for (int i = 0; i < int(int(v.size())); i++) {
    if (i) out << ", ";
    out << v[i];
  }
  return out << "]";
}
void swap(int &a, int &b) {
  int temp;
  temp = a;
  a = b;
  b = temp;
}
vector<int> sieveOfEratosthenes(int n) {
  vector<int> primes(n + 1, 1);
  vector<int> resultVector;
  primes[0] = 0;
  primes[1] = 0;
  for (int i = 2; i <= sqrt(n); i++) {
    if (primes[i] == 1) {
      for (int j = i * i; j <= n; j += i) {
        primes[j] = 0;
      }
    }
  }
  for (int i = 2; i <= n; i++) {
    if (primes[i] == 1) {
      resultVector.push_back(i);
    }
  }
  return resultVector;
}
bool isPrime(int number) {
  bool cond = true;
  if (number <= 1) {
    cond = false;
  } else if (number == 2 || number == 3) {
    cond = true;
  } else {
    for (int i = 2; i <= sqrt(number); i++) {
      if (number % i == 0) {
        cond = false;
        break;
      } else {
        continue;
      }
    }
  }
  return cond;
}
vector<int> returnAllFactors(int n) {
  vector<int> result;
  for (int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      result.push_back(i);
      if (i != sqrt(n)) {
        result.push_back(n / i);
      }
    }
  }
  sort((result).begin(), (result).end());
  return result;
}
int totalNumberOfDigits(int A) {
  int result = 0;
  while (A > 0) {
    A = A / 10;
    result++;
  }
  return result;
}
int extractIthDigit(int A, int i) {
  int result = (int(A / pow(10, i)) % 10);
  return result;
}
int reverseDigits(int A) {
  bool negative_number = false;
  if (A < 0) {
    negative_number = true;
    A = A * -1;
  }
  long long reverse = 0;
  int prev_reverse = 0;
  while (A > 0) {
    int current_digit = A % 10;
    reverse = reverse * 10 + current_digit;
    if ((reverse - current_digit) / 10 != prev_reverse) {
      return 0;
    }
    prev_reverse = reverse;
    A = A / 10;
  }
  if (negative_number && -reverse < INT32_MIN)
    return 0;
  else if (reverse > INT32_MAX)
    return 0;
  else
    return negative_number ? -reverse : reverse;
}
int gcdEuclidean(int A, int B) {
  if (B == 0) return A;
  return gcdEuclidean(B, A % B);
}
int lcm(int A, int B) { return (A * B) / gcdEuclidean(A, B); }
long long lb(long long target, long long l, long long h) {
  long long mid, fmid;
  long long answer = INT64_MAX;
  while (l <= h) {
    mid = (l + h) / 2;
    fmid = f(mid);
    if (fmid >= target) {
      h = mid - 1;
      answer = min(answer, mid);
    } else {
      l = mid + 1;
    }
  }
  return answer;
}
long long ub(long long target, long long l, long long h) {
  long long mid, fmid;
  long long answer = INT64_MAX;
  while (l <= h) {
    mid = (l + h) / 2;
    fmid = f(mid);
    if (fmid > target) {
      h = mid - 1;
      answer = min(answer, mid);
    } else {
      l = mid + 1;
    }
  }
  return answer;
}