Earliest Book Return Day

You are given an integer $n$ representing the number of books and a list of $n$ integers where each integer indicates the number of days that a book can be borrowed. Your task is to determine the earliest return day and count how many books are due on that day. Formally, let $d = \min_{1 \leq i \leq n} borrow\_days[i]$ and let $count$ be the number of times $d$ appears in the list. You should output $d$ and $count$.

inputFormat

The input consists of two lines. The first line contains an integer $n$ ($1 \le n \le 10^5$) representing the number of books. The second line contains $n$ space-separated integers, where the $i$-th integer represents the number of days for which the $i$-th book can be borrowed.

outputFormat

Output a single line with two integers separated by a space: the earliest return day (i.e. the minimum number from the list) and the number of books that are due on that day.## sample

3
10 5 8

5 1