#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long double pi = acos(-1.0);
int gcd(int a, int b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
long long binpows(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
int binpow(int a, int b, int m) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % m;
    a = a * a % m;
    b >>= 1;
  }
  return res;
}
const int mod = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  if (n == 1) {
    cout << 1 << "\n";
  } else if (n == 2 or n == 3) {
    cout << -1 << "\n";
  } else {
    deque<int> d;
    d.push_back(2);
    d.push_back(4);
    d.push_back(1);
    d.push_back(3);
    for (int i = 5; i <= n; i++) {
      if (i % 2 == 0) {
        d.push_front(i);
      } else {
        d.push_back(i);
      }
    }
    while (!d.empty()) {
      cout << d.front() << " ";
      d.pop_front();
    }
    cout << "\n";
  }
}
signed main() {
  cin.tie(NULL);
  cout.tie(NULL);
  ios_base::sync_with_stdio(false);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}
