CF1931C.Make Equal Again

You have an array $a$ of $n$ integers.

You can no more than once apply the following operation: select three integers $i$, $j$, $x$ ($1 \le i \le j \le n$) and assign all elements of the array with indexes from $i$ to $j$ the value $x$. The price of this operation depends on the selected indices and is equal to $(j - i + 1)$ burles.

For example, the array is equal to $[1, 2, 3, 4, 5, 1]$. If we choose $i = 2, j = 4, x = 8$, then after applying this operation, the array will be equal to $[1, 8, 8, 8, 5, 1]$.

What is the least amount of burles you need to spend to make all the elements of the array equal?

你有一个包含 $n$ 个整数的数组 $a$。

你最多可以执行一次如下操作：选择三个整数 $i$、$j$、$x$（满足 $1 \le i \le j \le n$），并将数组中下标从 $i$ 到 $j$ 的所有元素赋值为 $x$。该操作的代价取决于所选下标，其值为 $(j - i + 1)$ 卢布。

例如，数组为 $[1, 2, 3, 4, 5, 1]$。若我们选择 $i = 2$、$j = 4$、$x = 8$，则执行该操作后，数组将变为 $[1, 8, 8, 8, 5, 1]$。

为使数组中所有元素相等，你至少需要花费多少卢布？

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

The first line of the description of each test case contains a single integer $n$ ($1 \le n \le 2 \cdot 10 ^ 5$) — the size of the array.

The second line of the description of each test case contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le n$) — array elements.

It is guaranteed that the sum of $n$ for all test cases does not exceed $2 \cdot 10^5$.

第一行包含一个整数 $t$（$1 \le t \le 10^4$）—— 输入测试用例的数量。随后是各测试用例的描述。

每个测试用例的描述的第一行包含一个整数 $n$（$1 \le n \le 2 \cdot 10 ^ 5$）—— 数组的大小。

每个测试用例的描述的第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le n$）—— 数组元素。

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

For each test case, output one integer — the minimum number of burles that will have to be spent to make all the elements of the array equal. It can be shown that this can always be done.

对于每个测试用例，输出一个整数——使数组所有元素相等所需花费的 burles 的最小数量。可以证明，这总是可行的。