#include <bits/stdc++.h>
using namespace std;
int dis[200009];
int con[200009];
bool cmp(int a, int b) { return a < b; }
int main() {
  int i, p, j, n, t, y;
  int x;
  long long int nail;
  scanf("%d", &n);
  for (i = 0; i <= n - 1; i++) scanf("%d", &dis[i]);
  sort(dis, dis + n, cmp);
  nail = 99999999999;
  j = 0;
  y = 0;
  for (i = 1; i <= n - 1; i++) {
    x = dis[i] - dis[i - 1];
    con[i] = x;
    if (x < nail) nail = x;
  }
  for (i = 1; i <= n - 1; i++)
    if (nail == con[i]) y++;
  printf("%lld %d\n", nail, y);
  return 0;
}
