Long long ago, the universe existed as a high-dimensional space. Planets are neatly arranged here. Interstellar conflicts occur frequently, yet counterattacks are not allowed.
In an $$$n$$$-dimensional space, the coordinate of the $$$i$$$-th dimension is an integer within the range $$$[1, a_i]$$$. The set of all lattice points is defined as:
$$$$$$ \{(x_1, x_2, \dots, x_n) \mid 1 \le x_i \le a_i,\ x_i \in \mathbb{Z}\}. $$$$$$
Initially, all points satisfying $$$x_i \le b_i$$$ for every $$$i$$$ are colored black (every coordinate is no larger than the corresponding threshold $$$b_i$$$), and all other points are white.
Alice and Bob take turns to perform operations, and Alice moves first. In each turn, the current player must select a white point $$$P = (x_1, x_2, \dots, x_n)$$$. After the selection, all points $$$Q = (y_1, y_2, \dots, y_n)$$$ satisfying $$$y_i \ge x_i$$$ for every $$$i$$$ will be colored black. A player loses if they cannot choose any white point to operate on.
Both players adopt optimal strategies. For each test case, determine whether Alice has a winning strategy.
The first line contains an integer $$$T$$$ $$$(1 \le T \le 2\times 10^5)$$$, representing the number of test cases.
For each test case:
The first line contains an integer $$$n$$$ $$$(1\le n \le 2\times 10^5)$$$.
The second line contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ $$$(1 \le a_i \le 10^9)$$$.
The third line contains $$$n$$$ integers $$$b_1, b_2, \dots, b_n$$$ $$$(1 \le b_i \le a_i \le 10^9)$$$.
It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$2\times 10^5$$$.
For each test case, output one line. Print Yes if Alice has a winning strategy, otherwise print No. The answer is case-insensitive.
51105210 1010 1023 32 235 5 54 5 542022 1029 1430 1830100 100 45 100
Yes No Yes Yes Yes
