B'You are given an array a consisting of n positive integers. You can perform operations on it. In one operation you can replace any element of the array a_i with lfloor frac{a_i}{2} rfloor , that is, by an integer part of dividing a_i by 2 (rounding down). See if you can apply the operation some number of times (possible 0 ) to make the array a become a permutation of numbers from 1 to n --that is, so that it contains all numbers from 1 to n , each exactly once. For example, if a = [1, 8, 25, 2] , n = 4 , then the answer is yes. You could do the following: The first line of input data contains an integer t ( 1 <= t <= 10^4 ) --the number of test cases. Each test case contains exactly two lines. The first one contains an integer n ( 1 <= n <= 50 ), the second one contains integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ). For each test case, output on a separate line: You can output YES and NO in any case (for example, strings yEs, yes, Yes and YES will be recognized as a positive response). The first test case is explained in the text of the problem statement. In the second test case, it is not possible to get a permutation. '...