EOJ-自适应编程学习平台

Binary search the sorted array with bsearch. If not found, output $-1$.

The first line contains one integer $n$ ($1 \le n \le 10^5$).

The second line contains $n$ space-separated integers $a_1, a_2, \ldots, a_n$. It is guaranteed that $a_i < a_{i+1}$ for $1 \le i < n$. All numbers are distinct.

The third line contains one integer $q$ ($1 \le q \le 10^5$).

The next $q$ lines each contains one integer $k$, the number that is wanted.

All integers have absolute values no more than $10^9$.

For each query, report the index $i$ (starting from 1) where $a_i = k$. If not found, output $-1$.