Codeforces Round 929 (Div. 3) |
---|

Finished |

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

constructive algorithms

greedy

math

number theory

sortings

*1200

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Turtle Tenacity: Continual Mods

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputGiven an array $$$a_1, a_2, \ldots, a_n$$$, determine whether it is possible to rearrange its elements into $$$b_1, b_2, \ldots, b_n$$$, such that $$$b_1 \bmod b_2 \bmod \ldots \bmod b_n \neq 0$$$.

Here $$$x \bmod y$$$ denotes the remainder from dividing $$$x$$$ by $$$y$$$. Also, the modulo operations are calculated from left to right. That is, $$$x \bmod y \bmod z = (x \bmod y) \bmod z$$$. For example, $$$2024 \bmod 1000 \bmod 8 = (2024 \bmod 1000) \bmod 8 = 24 \bmod 8 = 0$$$.

Input

The first line of the input contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.

The first line of each test case contains a single integer $$$n$$$ ($$$2 \le n \le 10^5$$$).

The second line of each test case contains $$$n$$$ integers $$$a_1, a_2, \ldots, a_n$$$ ($$$1 \le a_i \le 10^9$$$).

The sum of $$$n$$$ over all test cases does not exceed $$$2 \cdot 10^5$$$.

Output

For each test case, output "YES" if it is possible, "NO" otherwise.

You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.

Example

Input

861 2 3 4 5 653 3 3 3 332 2 351 1 2 3 731 2 231 1 265 2 10 10 10 243 6 9 3

Output

YES NO YES NO YES NO YES NO

Note

In the first test case, rearranging the array into $$$b = [1, 2, 3, 4, 5, 6]$$$ (doing nothing) would result in $$$1 \bmod 2 \bmod 3 \bmod 4 \bmod 5 \bmod 6 = 1$$$. Hence it is possible to achieve the goal.

In the second test case, the array $$$b$$$ must be equal to $$$[3, 3, 3, 3, 3]$$$, which would result in $$$3 \bmod 3 \bmod 3 \bmod 3 \bmod 3 = 0$$$. Hence it is impossible to achieve the goal.

In the third test case, rearranging the array into $$$b = [3, 2, 2]$$$ would result in $$$3 \bmod 2 \bmod 2 = 1$$$. Hence it is possible to achieve the goal.

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/16/2024 03:00:15 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|