Description

Given $n$ closed intervals [$a_i$, $b_i$], where $i = 1, 2, ..., n$.
Any two adjacent or overlapping closed intervals can be merged into one closed interval. For example, [$1$, $2$] and [$2$, $3$] can be merged into [$1$, $3$], [$1$, $3$] and [$2$, $4$] can be merged into [$1$, $4$], but [$1$, $2$] and [$3$, $4$] cannot be merged.
Our task is to determine if these intervals can be merged into a single closed interval. If possible, output this closed interval; otherwise, output "$no$".

Input Format

The first line contains an integer $n$, $3 ≤ n ≤ 50000$, representing the number of intervals. The next $n$ lines each contain two integers $a_i$ and $b_i$, separated by a space, representing the interval [$a_i$, $b_i$] (where $1 ≤ a_i ≤ b_i ≤ 10000$).

Output Format

Output one line. If these intervals can be merged into a single closed interval, output the left and right boundaries of this closed interval, separated by a space; otherwise, output "$no$".

Sample

5
5 6
1 5
10 10
6 9
8 10

1 10