Pagini recente » Cod sursa (job #2616160) | Cod sursa (job #1955780) | Cod sursa (job #2148116) | Cod sursa (job #2939920) | Cod sursa (job #3258505)
#include <iostream>
#include <queue>
using namespace std;
deque<int> dq;
int main()
{
int t; cin >> t;
for(; t >= 1; t --)
{
int n; cin >> n;
if(n <= 4)
cout << -1 << '\n';
else{
dq.push_back(1);
dq.push_back(3);
dq.push_back(5);
dq.push_back(4);
dq.push_back(2);
for(int i = 6; i <= n; i ++)
if(i % 2 == 0)
dq.push_back(i);
else
dq.push_front(i);
while(!dq.empty()){
cout << dq.front() << " ";
dq.pop_front();
}
cout << '\n';
}
}
return 0;
}