First and Last Position

Medium#searching #binary-search· solved by 0 · time limit 2.0 s

In a sorted array (with duplicates) find the first and last index of $x$ (0-based), or -1 -1.

Input

$n$ and the sorted array, then $x$ .

Two indices.

$1 \le n \le 10^5$

Input

6
5 7 7 8 8 10
8

Output

3 4

Input

6
5 7 7 8 8 10
6

Output

-1 -1