Passport

A passport is a certificate that travelers use to enter foreign countries around the world.

There are $N$ countries on a planet, numbered from $1$ to $N$. Each country issues its own passport. A traveler holding the passport issued by country $i$ can enter countries $L_i, L_{i+1}, \dots, R_i$. It is guaranteed that a traveler can enter the country that issued the passport. That is, $L_i \le i \le R_i$.

Your friend likes to travel. At first he has no passport. He wants to visit all $N$ countries by repeating the following two actions.

• Get a passport issued by the country where he is currently staying.
• Move to a country he can enter with a passport he currently holds.

You do not know where he lives, so there are $Q$ candidate countries $X_1, X_2, \dots, X_Q$. For each candidate, determine whether he can visit all $N$ countries. If he can, find the minimum number of passports he needs to get.

The first line contains $N$. Each of the next $N$ lines contains $L_i$ and $R_i$. The next line contains $Q$. Each of the last $Q$ lines contains $X_j$.

Print $Q$ lines. The $j$-th line is the minimum number of passports needed when he lives in $X_j$, or $-1$ if he cannot visit all $N$ countries.

$2 \le N \le 200\,000$

$1 \le L_i \le i \le R_i \le N$ ($1 \le i \le N$)

$1 \le Q \le N$

$1 \le X_j \le N$ ($1 \le j \le Q$)

$X_j < X_{j+1}$ ($1 \le j \le Q-1$)

All given values are integers.