There is an edge-weighted complete binary tree with (n) leaves. A complete binary tree is defined as a tree where every non-leaf vertex has exactly 2 children. For each non-leaf vertex, we label one of its children as the left child and the other as the right child. The binary tree has a very strange property. For every non-leaf vertex, one of the edges to its children has weight (0) while the other edge has weight (1). Note that the edge with weight (0) can be connected to either its left or right child. You forgot what the tree looks like, but luckily, you still remember some information about the leaves in the form of an array (a) of size (n). For each (i) from (1) to (n), (a_i) represents the distance(^\dagger) from the root to the (i)-th leaf in dfs order(^\ddagger). Determine whether there exists a complete binary tree which satisfies array (a). Note that you do not need to reconstruct the tree. (^\dagger) The distance from vertex (u) to vertex (v) is defined as the sum of weights of the edges on the path from vertex (u) to vertex (v). (^\ddagger) The dfs order of the leaves is found by calling the following (dfs) function on the root of the binary tree. Each test contains multiple test cases. The first line contains a single integer (t) ((1 \leq t \leq 10^4)) — the number of test cases. The description of the test cases follows. The first line of each test case contains a single integer (n) ((2 \le n \le 2\cdot 10^5)) — the size of array (a). The second line of each test case contains (n) integers (a_1, a_2, \ldots, a_n) ((0 \le a_i \le n - 1)) — the distance from the root to the (i)-th leaf. It is guaranteed that the sum of (n) over all test cases does not exceed (2\cdot 10^5). For each test case, print "YES" if there exists a complete binary tree which satisfies array (a) and "NO" otherwise. You may print eac