Strange Solutions at Jeong Lab

Taeyoung is a scientist who runs experiments with strange solutions in his own small lab. The lab holds $N$ strange solutions of 1L each, and every solution contains component A and component B. Call this set of solutions $S$.

One day Taeyoung wants to prepare a new 1L solution for an experiment. He dislikes extra work, so he uses only these two methods.

1. Take one solution from $S$ and use it as it is.
2. Take two solutions from $S$ and mix them in any ratio he wants, so that the total is 1L.

The two components are spread evenly inside a solution. For example, if you draw 0.3L out of a 1L solution that contains 5 units of component A, the drawn part contains exactly 1.5 units of component A.

By Taeyoung's theory, more of component A and more of component B are both better for an experiment. He does not know which one matters more, so he calls a 1L solution $K$ a bad solution when it meets the condition below.

Condition: using one of the two methods on the solutions in $S$, he can prepare a solution whose amount of component A and amount of component B are both at least those of $K$.

While preparing an experiment, Taeyoung decided that his lab has too few solutions, so he went shopping. He shops for $M$ days, and because shopping is a bother too, he buys at most one solution per day. On day $i$ he does this.

1. He looks at a 1L solution $K_i$. If it is a bad solution, he buys nothing that day.
2. If $K_i$ is not a bad solution, he buys it and adds it to his collection $S$.

The decision on day $i$ is made with every solution bought on the earlier days already inside $S$.

Checking each solution by hand became a bother, so Taeyoung asked you for help. Decide, for every day, whether he should buy the solution.

The first line contains the number of solutions that the lab holds at the start, $N$ ($1 \leq N \leq 10^5$).

Each of the next $N$ lines contains two integers $a_i$, $b_i$ ($0 \leq a_i, b_i \leq 10^9$), the amount of component A and the amount of component B in the $i$-th solution.

The next line contains the number of shopping days, $M$ ($1 \leq M \leq 10^5$).

Each of the next $M$ lines contains two integers $c_i$, $d_i$ ($0 \leq c_i, d_i \leq 10^9$), the amount of component A and the amount of component B in the solution $K_i$.

Print exactly $M$ lines. On the $i$-th line print Yes if Taeyoung should buy the $i$-th solution, and No if he should not buy it.