CF459B.Pashmak and Flowers

Pashmak decided to give Parmida a pair of flowers from the garden. There are n flowers in the garden and the i-th of them has a beauty number b__i. Parmida is a very strange girl so she doesn't want to have the two most beautiful flowers necessarily. She wants to have those pairs of flowers that their beauty difference is maximal possible!

Your task is to write a program which calculates two things:

1. The maximum beauty difference of flowers that Pashmak can give to Parmida.
2. The number of ways that Pashmak can pick the flowers. Two ways are considered different if and only if there is at least one flower that is chosen in the first way and not chosen in the second way.

帕什马克决定从花园中挑选一对花送给帕米达。花园里共有 $n$ 朵花，其中第 $i$ 朵花的美丽值为 $b_i$。帕米达是个非常特别的女孩，因此她并不一定想要两朵最美丽的花；相反，她希望所选的这对花的美丽值之差尽可能大！

你的任务是编写一个程序，计算以下两个量：

1. 帕什马克能送给帕米达的花对的最大美丽值之差；
2. 帕什马克挑选花对的方式总数。当且仅当存在至少一朵花在第一种方式中被选中、而在第二种方式中未被选中时，这两种方式才被视为不同。

The first line of the input contains n (2 ≤ n ≤ 2·105). In the next line there are n space-separated integers _b_1, _b_2, ..., b__n (1 ≤ b__i ≤ 109).

输入的第一行包含一个整数 $n$（$2 \leq n \leq 2 \cdot 10^5$）。第二行包含 $n$ 个以空格分隔的整数 $b_1, b_2, \dots, b_n$（$1 \leq b_i \leq 10^9$）。

The only line of output should contain two integers. The maximum beauty difference and the number of ways this may happen, respectively.

输出仅有一行，包含两个整数：最大美观度差值，以及达到该最大差值的方案数。

In the third sample the maximum beauty difference is 2 and there are 4 ways to do this:

1. choosing the first and the second flowers;
2. choosing the first and the fifth flowers;
3. choosing the fourth and the second flowers;
4. choosing the fourth and the fifth flowers.

在第三个样例中，最大美丽值差为 2，共有 4 种选择方式：

1. 选择第一朵和第二朵花；
2. 选择第一朵和第五朵花；
3. 选择第四朵和第二朵花；
4. 选择第四朵和第五朵花。