#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <vector>
#include <sstream>
#include <math.h>
using namespace std;
int main ()
{
long n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
        cin>>arr[i];
}
sort(arr,arr+n);
long long ans=arr[n-1]-arr[0],ans1;
int cnt=0,cnt1=0;
for(int i=0;i<n;i++){
    if(arr[i]==arr[0])cnt++;
    if(arr[i]==arr[n-1])cnt1++;
}
if(arr[0]==arr[n-1]){
    ans1=(n*(n-1))/2;
}
else{
ans1=cnt1*cnt;
}
cout<<ans<<" "<<ans1<<endl;

return 0;
}