#1、Codeforces Round 640 (Div. 4) G. Special Permutation(思维题)

根据连续的奇数和偶数，他们天然的分割关系，构造出符合条件的结果，其实这样的条件本身就是一种提示。

vector<int> ji, ou;
signed main()
{
    int t;
    IOS;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        ji.clear();
        ou.clear();
        if (n < 4)
        {
            cout << -1 << endl;
            continue;
        }
        for (int i = 1; i <= n; i++)
        {
            if (i % 2 == 0)
            {
                ou.push_back(i);
            }
            else
            {
                ji.push_back(i);
            }
        }
        for (int i = ji.size() - 1; i >= 0; i--)
        {
            cout << ji[i] << ' ';
        }
        cout << "4 2";
        for (int i = 0; i < ou.size(); i++)
        {
            if (ou[i] == 2 || ou[i] == 4)
                continue;
            else
                cout << ' ' << ou[i];
        }
        cout << endl;
    }
    return 0;
}