Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Pashmak and Flowers

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPashmak 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:

- The maximum beauty difference of flowers that Pashmak can give to Parmida.
- 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.

Input

The first line of the input contains *n* (2 ≤ *n* ≤ 2·10^{5}). In the next line there are *n* space-separated integers *b* _{1}, *b* _{2}, ..., *b* _{ n} (1 ≤ *b* _{ i} ≤ 10^{9}).

Output

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

Examples

Input

2

1 2

Output

1 1

Input

3

1 4 5

Output

4 1

Input

5

3 1 2 3 1

Output

2 4

Note

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

- choosing the first and the second flowers;
- choosing the first and the fifth flowers;
- choosing the fourth and the second flowers;
- choosing the fourth and the fifth flowers.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/15/2020 22:56:07 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|