Find the smallest number in a list of natural (integer and positive) numbers.

Input

One line indicating the quantity of numbers in the list, N [1 <= N <= 1.000.000]

Another line with N natural numbers. Each number n_i is between 0 and 32576 inclusive.

Output

Two lines:

The first line should have the smallest number in the list.

The second one should have how many times the smallest number appears in the list.

Example

Input:
6
6 4 8 2 1 3

Output:
1
1