|Codeforces Round 903 (Div. 3)|
You are given an array $$$a$$$ consisting of $$$n$$$ positive integers. You can perform the following operation on it:
For example, let's consider the array $$$a$$$ = [$$$100, 2, 50, 10, 1$$$] with $$$5$$$ elements. Perform two operations on it:
The first line of the input contains a single integer $$$t$$$ ($$$1 \le t \le 2000$$$) — the number of test cases.
Then follows the description of each test case.
The first line of each test case contains a single integer $$$n$$$ ($$$1 \le n \le 10^4$$$) — the number of elements in the array $$$a$$$.
The second line of each test case contains exactly $$$n$$$ integers $$$a_i$$$ ($$$1 \le a_i \le 10^6$$$) — the elements of the array $$$a$$$.
It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$10^4$$$.
For each test case, output a single line:
You can output the answer in any case (for example, the strings "yEs", "yes", "Yes", and "YES" will all be recognized as a positive answer).
75100 2 50 10 131 1 148 2 4 2430 50 27 20275 4024 432 3 1
YES YES NO YES NO YES NO
The first test case is explained in the problem statement.