Nowruz Cup 2015

Input

First line contains integer $n$. Next line contains $2n$ space separated integers a_i (1 \le a_i \le 10^5, 1 \le i \le 2n).

Output

Print two integers - the highest and the lowest place of Amanchik's team.

Examples

Note

In the first example, if we divide the participants in the following way ($999$, $2$) ($3$, $1$) ($1000$, $1$), Amanchik's team ($999$, $2$) and team ($1000$, $1$) will take the first place, and the team ($3$, $1$) will take the third place. If we divide the participants like ($999$, $1$) ($1000$, $2$) ($3$, $1$), Amanchik's team will take second place. Out of the various partitions, the above will meet the highest and lowest places.