B"Polycarp was recently given a set of n (number n -- even) dominoes. Each domino contains two integers from 1 to n . Can he divide all the dominoes into two sets so that all the numbers on the dominoes of each set are different? Each domino must go into exactly one of the two sets. For example, if he has 4 dominoes: {1, 4 } , {1, 3 } , {3, 2 } and {4, 2 } , then Polycarp will be able to divide them into two sets in the required way. The first set can include the first and third dominoes ( {1, 4 } and {3, 2 } ), and the second set -- the second and fourth ones ( {1, 3 } and {4, 2 } ). The first line contains a single integer t ( 1 <= t <= 10^4 ) -- the number of test cases. The descriptions of the test cases follow. The first line of each test case contains a single even integer n ( 2 <= n <= 2 cdot 10^5 ) -- the number of dominoes. The next n lines contain pairs of numbers a_i and b_i ( 1 <= a_i, b_i <= n ) describing the numbers on the i -th domino. It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case print: You can print YES and NO in any case (for example, the strings yEs, yes, Yes and YES will be recognized as a positive answer). In the first test case, the dominoes can be divided as follows: In the second test case, there's no way to divide dominoes into 2 sets, at least one of them will contain repeated number. "...