#include <bits/stdc++.h>
using namespace std;
template <typename TA, typename TB>
ostream &operator<<(ostream &ostm, const pair<TA, TB> &p) {
  ostm << "(" << p.first << "," << p.second << ")";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const vector<T> &v) {
  ostm << "[ ";
  for (auto i : v) ostm << i << " ";
  ostm << "]";
  return ostm;
}
template <typename TA, typename TB>
ostream &operator<<(ostream &ostm, const map<TA, TB> &mp) {
  ostm << "[ ";
  for (auto &it : mp) ostm << it << " ";
  ostm << "]";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const set<T> &s) {
  ostm << "[ ";
  for (auto &it : s) ostm << it << " ";
  ostm << "]";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const stack<T> &inp) {
  stack<T> st = inp;
  ostm << "[ ";
  while (!st.empty()) {
    ostm << st.top() << " ";
    st.pop();
  }
  ostm << "]";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const queue<T> &inp) {
  queue<T> q = inp;
  ostm << "[ ";
  while (!q.empty()) {
    ostm << q.front() << " ";
    q.pop();
  }
  ostm << "]";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const priority_queue<T> &inp) {
  priority_queue<T> pq = inp;
  ostm << "[ ";
  while (!pq.empty()) {
    ostm << pq.top() << " ";
    pq.pop();
  }
  ostm << "]";
  return ostm;
}
template <typename T>
ostream &operator<<(ostream &ostm, const deque<T> &inp) {
  deque<T> dq = inp;
  ostm << "[ ";
  while (!dq.empty()) {
    ostm << dq.front() << " ";
    dq.pop_front();
  }
  ostm << "]";
  return ostm;
}
inline int gtx() {
  const int N = 1048576;
  static char __buffer[N];
  static char *__p = __buffer, *__end = __buffer;
  if (__p == __end) {
    if ((__end = __buffer + fread(__buffer, 1, N, stdin)) == __buffer)
      return EOF;
    __p = __buffer;
  }
  return *__p++;
}
template <typename T>
inline bool rit(T &x) {
  char c = 0;
  bool fg = 0;
  while (c = gtx(), (c < '0' && c != '-') || c > '9')
    if (c == EOF) return false;
  c == '-' ? (fg = 1, x = 0) : (x = c - '0');
  while (c = gtx(), c >= '0' && c <= '9') x = x * 10 + c - '0';
  if (fg) x = -x;
  return true;
}
template <typename T, typename... Args>
inline bool rit(T &x, Args &...args) {
  return rit(x) && rit(args...);
}
inline void pit(int x) { printf("%d", x); }
inline void pln(long long x) { printf("%I64d", x); }
template <typename... Args>
inline void pit(int x, Args... args) {
  printf("%d ", x);
  pit(args...);
}
template <typename... Args>
inline void pln(long long x, Args... args) {
  printf("%I64d ", x);
  pit(args...);
}
void JIZZ() {
  cout << "";
  exit(0);
}
const long double PI = 3.14159265358979323846264338327950288;
const long double eps = 1e-8;
const long long mod = 1e9 + 7;
int a[200006];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> a[i];
  sort(a, a + n);
  int mn = 2147483647;
  for (int i = 1; i < n; ++i) {
    mn = min(mn, a[i] - a[i - 1]);
  }
  int cnt = 0;
  for (int i = 1; i < n; ++i) {
    if (a[i] - a[i - 1] == mn) ++cnt;
  }
  cout << mn << " " << cnt << '\n';
}
