EOJ-自适应编程学习平台

Input an integer $n$ ($1 \le n \le 1000$) in first line，$n$ integers with one blank separated into an array in second line, and an integer $m$ in third line.

Use binary search algorithm to find and output the position of $m$ in the array (position starts with $1$).

Output not found if $m$ is not in the array.

Assume all integers inputted in the array have different values, and in ascending order.

All integers have absolute values less than $2^{31}$.

7
1 3 5 7 53 355 3432
3

2