CF1603A.Di-visible Confusion

YouKn0wWho has an integer sequence $a_1, a_2, \ldots, a_n$. He will perform the following operation until the sequence becomes empty: select an index $i$ such that $1 \le i \le |a|$ and $a_i$ is not divisible by $(i + 1)$, and erase this element from the sequence. Here $|a|$ is the length of sequence $a$ at the moment of operation. Note that the sequence $a$ changes and the next operation is performed on this changed sequence.

For example, if $a=[3,5,4,5]$, then he can select $i = 2$, because $a_2 = 5$ is not divisible by $i+1 = 3$. After this operation the sequence is $[3,4,5]$.

Help YouKn0wWho determine if it is possible to erase the whole sequence using the aforementioned operation.

YouKn0wWho 有一个整数序列 $a_1, a_2, \ldots, a_n$。他将重复执行以下操作，直到序列变为空：选择一个下标 $i$，满足 $1 \le i \le |a|$，且 $a_i$ 不能被 $(i + 1)$ 整除，并将该元素从序列中删除。其中 $|a|$ 表示当前操作时序列 $a$ 的长度。注意，序列 $a$ 会随之改变，后续操作均在更新后的序列上进行。

例如，若 $a=[3,5,4,5]$，则他可以选择 $i = 2$，因为 $a_2 = 5$ 不能被 $i+1 = 3$ 整除。执行该操作后，序列变为 $[3,4,5]$。

请帮助 YouKn0wWho 判断：能否通过上述操作将整个序列全部删除。

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

The first line of each test case contains a single integer $n$ ($1 \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$).

It is guaranteed that the sum of $n$ over all test cases doesn't exceed $3 \cdot 10^5$.

第一行包含一个整数 $t$（$1 \le t \le 10\,000$），表示测试用例的数量。

每个测试用例的第一行包含一个整数 $n$（$1 \le n \le 10^5$）。

每个测试用例的第二行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$（$1 \le a_i \le 10^9$）。

保证所有测试用例的 $n$ 之和不超过 $3 \cdot 10^5$。

For each test case, print "YES" (without quotes) if it is possible to erase the whole sequence using the aforementioned operation, print "NO" (without quotes) otherwise. You can print each letter in any register (upper or lower).

对于每个测试用例，如果可以使用上述操作将整个序列完全删除，则输出 "YES"（不带引号）；否则输出 "NO"（不带引号）。每个字母可使用大写或小写形式输出。

In the first test case, YouKn0wWho can perform the following operations (the erased elements are underlined): $[1, \underline{2}, 3] \rightarrow [\underline{1}, 3] \rightarrow [\underline{3}] \rightarrow [\,].$

In the second test case, it is impossible to erase the sequence as $i$ can only be $1$, and when $i=1$, $a_1 = 2$ is divisible by $i + 1 = 2$.

在第一个测试用例中，YouKn0wWho 可以执行以下操作（被删除的元素用下划线标出）：$[1, \underline{2}, 3] \rightarrow [\underline{1}, 3] \rightarrow [\underline{3}] \rightarrow [\,].$

在第二个测试用例中，无法删除该序列，因为此时 $i$ 只能为 $1$，而当 $i=1$ 时，$a_1 = 2$ 能被 $i + 1 = 2$ 整除。