#M. JIXMPII5JUh0SM0#~//

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z [ \ ] ^ _ ` a b c d e f g h i j k l m n

传统题

2000ms

256MiB

该比赛已结束，您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

Statement

Mocha likes arrays, so before her departure, 378QAQ gave her an array $a$ consisting of $n$ positive integers as a gift.

Mocha thinks that $a$ is beautiful if there exist two numbers $i$ and $j$ ( $1\leq i,j\leq n$ , $i\neq j$ ) such that for all $k$ ( $1 \leq k \leq n$ ), $a_k$ is divisible $^\dagger$ by either $a_i$ or $a_j$ .

Determine whether $a$ is beautiful.

$^\dagger$ $x$ is divisible by $y$ if there exists an integer $z$ such that $x = y \cdot z$ .

Format

Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1\leq t\leq 500$ ). The description of the test cases follows.

The first line of each test case contains a single integer $n$ ( $3\leq n\leq 10^5$ ) — the length of the array $a$ .

The second line of each test case contains $n$ integers $a_1,a_2,\ldots,a_n$ ( $1\leq a_i \leq 10^9$ ) — the elements of the array $a$ .

It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$ .

Output

For each test case, output "Yes" if array $a$ is beautiful, and output "No" otherwise.

Sample

4
3
7 3 8
5
7 1 9 3 5
5
4 12 2 6 3
5
7 49 9 3 1000000000

No
Yes
Yes
No

ShanghaiTech ACM 炸鱼杯

未参加

状态: 已结束
规则: OI
题目: 46
开始于: 2024-12-10 23:00
结束于: 2024-12-15 13:00
持续时间: 110 小时
主持人: _Arahc_
参赛人数: 112

#M. JIXMPII5JUh0SM0#~//

JIXMPII5JUh0SM0#~//

Statement

Format

Input

Output

Sample

ShanghaiTech ACM 炸鱼杯

状态

开发

支持

#M. JIXMPII5JUh0SM0#~//

JIXMPII5JUh0SM0#~//

Statement

Format

Input

Output

Sample

ShanghaiTech ACM 炸鱼杯

状态

开发

支持

还没有账户？

登录