#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1, -1, -1, 1, 1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
template <class T>
inline T biton(T n, T pos) {
  return n | ((T)1 << pos);
}
template <class T>
inline T bitoff(T n, T pos) {
  return n & ~((T)1 << pos);
}
template <class T>
inline T ison(T n, T pos) {
  return (bool)(n & ((T)1 << pos));
}
template <class T>
inline T gcd(T a, T b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
inline int nxt() {
  int aaa;
  scanf("%d", &aaa);
  return aaa;
}
inline long long lxt() {
  long long aaa;
  scanf("%lld", &aaa);
  return aaa;
}
inline double dxt() {
  double aaa;
  scanf("%lf", &aaa);
  return aaa;
}
template <class T>
inline T bigmod(T p, T e, T m) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % m;
    p = (p * p) % m;
  }
  return (T)ret;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& input) {
  bool isFirst = true;
  for (T out : input) {
    if (isFirst) {
      os << out;
      isFirst = false;
    } else
      os << " " << out;
  }
  return os;
}
vector<int> ans, vis;
int n;
int dp[1001][1001];
int F(int pos, int num) {
  if (pos >= n) {
    return true;
  }
  int& ret = dp[pos][num];
  ret = 0;
  for (int x = max(1, num - 4); x <= min(num + 4, n); x++) {
    if (vis[x] == 1 || abs(num - x) < 2 || abs(num - x) > 4) continue;
    vis[x] = 1;
    if (F(pos + 1, x)) {
      ans.push_back(x);
      return ret = 1;
    }
    vis[x] = 0;
  }
  return ret;
}
void solve() {
  n = nxt();
  for (int i = 1; i < min(200, n); i++) {
    vis.assign(n + 1, 0);
    memset(dp, -1, sizeof(dp));
    ans.clear();
    if (F(0, 1) && (int)(ans).size() == n) {
      cout << ans << '\n';
      return;
    }
  }
  cout << -1 << '\n';
}
int main() {
  cout.setf(ios::fixed);
  cout.precision(10);
  int tc = nxt();
  while (tc--) {
    solve();
  }
  return 0;
}
