There are *n* cities situated along the main road of Berland. Cities are represented by their coordinates — integer numbers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>. All coordinates are pairwise distinct.

It is possible to get from one city to another only by bus. But all buses and roads are very old, so the Minister of Transport decided to build a new bus route. The Minister doesn't want to spend large amounts of money — he wants to choose two cities in such a way that the distance between them is minimal possible. The distance between two cities is equal to the absolute value of the difference between their coordinates.

It is possible that there are multiple pairs of cities with minimal possible distance, so the Minister wants to know the quantity of such pairs. 

Your task is to write a program that will calculate the minimal possible distance between two pairs of cities and the quantity of pairs which have this distance.
The first line contains one integer number *n* (2 ≤ *n* ≤ 2·10<sup class="upper-index">5</sup>).

The second line contains *n* integer numbers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> ( - 10<sup class="upper-index">9</sup> ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>). All numbers *a*<sub class="lower-index">*i*</sub> are pairwise distinct.
In the first example the distance between the first city and the fourth city is |4 - 6| = 2, and it is the only pair with this distance.
4
6 -3 0 4
2 1
3
-2 0 2
2 2
2
1 2
1 1
2
1000000000 -1000000000
2000000000 1
5
-979619606 -979619602 -979619604 -979619605 -979619603
1 4
5
-799147771 -799147773 -799147764 -799147774 -799147770
1 2
20
553280626 553280623 553280627 553280624 553280625 553280618 553280620 553280629 553280637 553280631 553280628 553280636 553280635 553280632 553280634 553280622 553280633 553280621 553280630 553280619
1 19
20
105619866 106083760 106090730 105809555 106115212 105155938 105979518 106075627 106145216 105637844 105925719 105498536 105927000 106155938 106134226 106125969 106130588 105464813 106145509 106114971
241 1
10
570685866 570685854 570685858 570685850 570685856 570685864 570685860 570685852 570685862 570685868
2 9
2
1 1000000000
999999999 1
6
1 2 3 4 5 6
1 5
3
7 10 12
2 1
5
-7 -5 -4 -3 -1
1 2
4
-6 -4 -2 1
2 2
4
3 5 7 8
1 1
9
-9 -8 -7 -6 -5 -4 -3 -2 -1
1 8
2
15 13
2 1
2
14 13
1 1
2
12 13
1 1
2
-1000000000 13265920
1013265920 1
2
8 10
2 1
x=int(input())
y=input()
a=[int(i) for i in y.split()]
a.sort()
b=[]
i=0
while i<len(a)-1:
    b.append(abs(a[i]-a[i+1]))
    i+=1
print(min(b),b.count(min(b)))
