Problem: You are given an array a consisting of n integers.

In one move, you can choose some index i (1 ≤ i ≤ n - 2) and shift the segment [a_i, a_{i + 1}, a_{i + 2}] cyclically to the right (i.e. replace the segment [a_i, a_{i + 1}, a_{i + 2}] with [a_{i + 2}, a_i, a_{i + 1}]). 

Your task is to sort the initial array by no more than n^2 such operations or say that it is impossible to do that.

You have to answer t independent test cases.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 100) — the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (3 ≤ n ≤ 500) — the length of a. The second line of the test case contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 500), where a_i is the i-th element a.

It is guaranteed that the sum of n does not exceed 500.

Output

For each test case, print the answer: -1 on the only line if it is impossible to sort the given array using operations described in the problem statement, or the number of operations ans on the first line and ans integers idx_1, idx_2, ..., idx_{ans} (1 ≤ idx_i ≤ n - 2), where idx_i is the index of left border of the segment for the i-th operation. You should print indices in order of performing operations.

Example

Input


5
5
1 2 3 4 5
5
5 4 3 2 1
8
8 4 5 2 3 6 7 3
7
5 2 1 6 4 7 3
6
1 2 3 3 6 4


Output


0

6
3 1 3 2 2 3 
13
2 1 1 6 4 2 4 3 3 4 4 6 6 
-1
4
3 3 4 4 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int M = 110000;
const unsigned long long inf = 9e18;
int n, m, k;
int a[M];
int cal(int s) {
  int p = s;
  for (int i = (s + 1); i <= (n); ++i)
    if (a[i] < a[p]) p = i;
  return p;
}
vector<int> ans;
void mv(int x) {
  int t = a[x];
  a[x] = a[x + 2];
  a[x + 2] = a[x + 1];
  a[x + 1] = t;
  ans.push_back(x);
}
int b[555];
void solve() {
  ans.clear();
  int num[555] = {0};
  cin >> n;
  for (int i = (1); i <= (n); ++i) {
    cin >> a[i];
    b[i] = a[i];
  }
  sort(b + 1, b + 1 + n);
  for (int i = (1); i <= (n); ++i) {
    int pos = lower_bound(b + 1, b + 1 + n, a[i]) - b;
    a[i] = pos + num[pos];
    ++num[pos];
  }
  int inv = 0;
  for (int i = (1); i <= (n); ++i) {
    for (int j = (i + 1); j <= (n); ++j) {
      if (a[j] < a[i]) ++inv;
    }
  }
  if (inv & 1) {
    for (int i = (1); i <= (n - 1); ++i) {
      if (b[i] == b[i + 1]) {
        for (int j = (1); j <= (n); ++j) {
          if (a[j] == i)
            ++a[j];
          else if (a[j] == i + 1)
            --a[j];
        }
        break;
      }
    }
  }
  for (int c = (1); c <= (n - 2); ++c) {
    int t = cal(c);
    while (t > c + 1) {
      t -= 2;
      mv(t);
    }
    if (t > c) {
      mv(c);
      mv(c);
    }
  }
  if (a[n - 1] > a[n])
    cout << -1 << endl;
  else {
    cout << (ans.size()) << endl;
    for (int x : ans) cout << x << ' ';
    puts("");
  }
}
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}