In a supermarket, goods of the same type are usually placed next to each other so that the shelf looks neat and it is easier for customers to find what they need. The shelf is described by an array (a) of (n) elements, where (a_i) is the type of the good at position (i). We will say that the shelf is arranged correctly if for every two positions (i) and (j) such that (1 \le i \lt j \le n) and (a_i = a_j), the following condition holds: for each (k) from (i) to (j), it is true that (a_k = a_i). In other words, goods of each type on the shelf must form one contiguous block. You are allowed to choose two different positions at most once and swap the goods at these positions. You may also choose not to perform any swap. Determine whether it is possible to make the shelf arranged correctly after that. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains an integer (n) ((2 \le n \le 2 \cdot 10^{5})) — the number of goods on the shelf. The second line of each test case contains (n) integers (a_{i}) ((1 \le a_{i} \le 10^{9})), where (a_{i}) denotes the type of the good at position (i). Additional input constraints: the sum of (n) over all test cases does not exceed (2 \cdot 10^{5}). For each test case, output one of the following: NO , if it is impossible to arrange the shelf correctly; YES , if it is possible to make the shelf arranged correctly with at most one swap of two goods. You may output the answer in any case. For example, " YeS ", " YES ", " NO ", " nO " will also be accepted. In the first example, you can swap the goods at positions (1) and (2), after which the shelf will look like this: (2, 1, 1). In the second example, the shelf is already arranged correctly. In the third example, it is impossible to a